Product Description
All traditional implementation techniques for functional languages fail to avoid useless repetition of work. They are not "optimal" in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This work, the first on the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of Lévy and to Girard's more recent "Geometry of Interaction" are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers in lambda calculus, functional programming or linear logic. ... Read more

Product Description
This book offers a comprehensive view of the best and thelatest work infunctional programming. It is the proceedingsof a major internationalconference and contains 30 papersselected from 126 submitted. A number ofthemes emerge. Oneis a growing interest in types: powerful type systemsortype checkers supporting overloading, coercion, dynamictypes, and incremental inference; linear types to optimizestorage, and polymorphictypes to optimize semanticanalysis. The hot topic of partial evaluation is wellrepresented: techniques for higher-order binding-timeanalysis,assuring termination of partial evaluation, andimproving the residualprograms a partial evaluatorgenerates. The thorny problem of manipulatingstate infunctional languages is addressed: one paper even arguesthatparallel programs with side-effects can be "moredeclarative" than purely functional ones. Theoretical workcovers a new model of types based onprojections,parametricity, a connection between strictness analysisandlogic, and a discussion of efficient implementations of thelambda-calculus. The connection with computer architectureand avariety of other topics are also addressed. ... Read more

Product Description
Modern "non-strict" functional programming languages are a powerfulmeans of programming highly parallel computers but are intrinsicallydifficult to compile well because decisions about the ordering ofsubcomputations must be made at the time of compiling. This bookrepresents a new technique for compiling such languages by partitioninga program into sequential threads. While the interleaving of threads canvary at run time, within each thread the order is fixed.

A program is compiled by analyzing its data dependences and developingfrom that a set of partitioning constraints. These practical algorithmsare founded on a new theory of data dependence and ordering withinfunctional programs, which defines dependence graphs in terms of arewrite-rule operational semantics for the language.

By attacking the ordering problem directly, the book departs fromprevious approaches that obtain partitioning as a by-product ofoptimizing lazy evaluation and cleanly separates partitioning from othercode-generation issues. Furthermore, the method is flexible enough toproduce both lazy code and a less-restrictive "lenient" variant thatallows larger threads with only a slight decrease in expressive power.Code generation and optimization are explored in depth for bothuniprocessor and multiprocessor targets. ... Read more

Product Description
This book constitutes the refereed proceedings of the First International Symposium on Functional Programming Languages in Education, FPLE '95, held in Nijmegen, The Netherlands in December 1995. The 17 revised full papers included represent the current state-of-the-art in using functional languages in computer science education. Most papers report teaching experience in some detail, however, the emphasis is generally on technical issues. Functional languages are increasingly used for teaching in a number of important areas such as algorithms, data structures, compiler construction, computer architecture, computer graphics, mathematics, problem solving and the semantics of programming languages. ... Read more

Product Description
This volume contains the proceedings of the Third Conference on Functional Programming Languages and Computer Architecture held in Portland, Oregon, September 14-16, 1987. This conference was a successor to two highly successful conferences on the same topics held at Wentworth, New Hampshire, in October 1981 and in Nancy, in September 1985. Papers were solicited on all aspects of functional languages and particularly implementation techniques for functional programming languages and computer architectures to support the efficient execution of functional programs. The contributions collected in this volume show that many issues regarding the implementation of Functional Programming Languages are now far better understood. ... Read more

Product Description
Functional programming languages have been proposedto enhance the clarity of programs, to increaseprogrammer productivity, and to reduce thedifficulties of program verification. However, thelack of efficient implementation on conventionalarchitectures prevents them from being widelyaccepted. This book presents an approach for solvingthis problem. A pipelined parallel reduction systemhas been developed on a multiprocessor system torealize hierarchical parallel processing. Thecorrectness, reasonability and termination of theparallel execution can be guaranteed by enrichingthe lambda calculus lying behind functionallanguages. The scheduling strategies are alsoinvestigated for balancing processor loads andreducing processor idle ratio. The results ofperformance evaluation have exhibited the potentialof the proposed functional architecture. The authorbelieves this book would be a useful reference forthose interested in understanding the implementationof functional languages. ... Read more

Product Description
SAC is a functional array processing language, which aims at combining generic, high level program specifications with efficient runtime behaviour of compiled code. In contrast to other languages with strong support for arrays, e.g. FORTRAN-90, SAC provides very few basic array operations as built-in functions. Instead, aggregate operations on arrays are specified in SAC itself by means of WITH-loops. This versatile language construct supports dimension-invariant specifications and, thus, allows for implementing generic array operations which are still applicable to arrays of any size and dimensionality. By means of comprehensive library, SAC provides about the same array processing functionality as is built-in in languages such as FORTRAN 90 or APL. Despite this generic approach, SAC achieves competitive runtime performance figures in uniprocessor enviroments. Due to its functional, side-effect free semantics and its specific support for aggregate array operations, SAC may be considered relatively well-suited for non-sequential programm execution. However, no support for this has been available yet.Therfore, this thesis investigates opportunities to substantially reduce program execution times by implicitly exploiting shared memory multiprozessors. For this purpose, compilations schemes and runtime system support are developed, which allow to benefit from additional processing resources by simple re-compilation of high-level SAC specifications. The aim is to achieve considerable, preferably linear speedups relative to uniprocessor runtime performance characteristics, which are competitive to low-level programming models. ... Read more

Product Description
The Dylan programming language is a multi-paradigm language that includes support for functional and object-oriented programming, and is dynamic and reflective while providing a programming model designed to support efficient machine code generation, including fine-grained control over dynamic and static behaviors. It was created in the early 1990s by a group led by Apple Computer. ?Dylan? like the surname of Bob Dylan. Dylan derives from Scheme and Common Lisp and adds an integrated object system derived from the Common Lisp Object System (CLOS). In Dylan, all values (including numbers, characters, functions, and classes) are first-class objects. Dylan supports multiple inheritance, polymorphism, multiple dispatch, keyword arguments, object introspection, pattern-based syntax extension macros, and many other advanced features. Programs can express fine-grained control over dynamism, admitting programs that occupy a continuum between dynamic and static programming and supporting evolutionary development (allowing for rapid prototyping followed by incremental refinement and optimization). ... Read more

Product Description
Chapters: Oz, Curry, Algebraic Logic Functional Programming Language, Alice, Metal, Mozart Programming System, Leda. Source: Wikipedia. Pages: 28. Not illustrated. Free updates online. Purchase includes a free trial membership in the publisher's book club where you can select from more than a million books without charge. Excerpt: Oz is a multiparadigm programming language, developed in the Programming Systems Lab at Université catholique de Louvain, for programming language education. It has a canonical textbook: Concepts, Techniques, and Models of Computer Programming. Oz was first designed by Gert Smolka and his students in 1991. In 1996 the development of Oz continued in cooperation with the research group of Seif Haridi and Peter Van Roy at the Swedish Institute of Computer Science. Since 1999, Oz has been continually developed by an international group, the Mozart Consortium, which originally consisted of Saarland University, the Swedish Institute of Computer Science, and the Université catholique de Louvain. In 2005, the responsibility for managing Mozart development was transferred to a core group, the Mozart Board, with the express purpose of opening Mozart development to a larger community. The Mozart Programming System is the primary implementation of Oz. It is released with an open source license by the Mozart Consortium. Mozart has been ported to different flavors of Unix, FreeBSD, Linux, Microsoft Windows, and Mac OS X. Oz contains most of the concepts of the major programming paradigms, including logic, functional (both lazy and eager), imperative, object-oriented, constraint, distributed, and concurrent programming. Oz has both a simple formal semantics (see chapter 13 of the book mentioned below) and an efficient implementation. Oz is a concurrency-oriented language, as the term was introduced by Joe Armstrong, the main designer of the Erlang language. A concurrency-oriented language makes concurrency both e...More: http://booksllc.net/?id=256916 ... Read more