This book offers a comprehensive view of the best and the latest work in functional programming. It is the proceedings of a major international conference and contains 30 papers selected from 126 submitted. A number of themes emerge. One is a growing interest in types: powerful type systems or type checkers supporting overloading, coercion, dynamic types, and incremental inference; linear types to optimize storage, and polymorphic types to optimize semantic analysis. The hot topic of partial evaluation is well represented: techniques for higher-order binding-time analysis, assuring termination of partial evaluation, and improving the residual programs a partial evaluator generates. The thorny problem of manipulating state in functional languages is addressed: one paper even argues that parallel programs with side-effects can be "more declarative" than purely functional ones. Theoretical work covers a new model of types based on projections, parametricity, a connection between strictness analysis and logic, and a discussion of efficient implementations of the lambda-calculus. The connection with computer architecture and a variety of other topics are also addressed.

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.

Functional Programming is a relatively new area of computer science. These proceedings contain 25 papers representing an excellent snapshot of the current state of functional programming and are written by the leading computer scientists in this aera. In some universities, a functional programming language is used as the introductory teaching language and computer architectures are being designed and investigated to support functional languages.

The Glasgow functional programming group has held a workshop each summer since 1988. The entire group, accompanied by a selection of colleagues from other institutions, retreats to a pleasant Scottish location for a few days. Everyone speaks briefly, enhancing coherence, cross fertilisation, and camaraderie in our work. The proceedings of the first workshop were published as a technical report. Demand for this was large enough to encourage wider publication, and subsequent proceedings have been published in the Springer-Verlag Workshops in Computing series. These are the proceedings of the-meeting held 12-14 August 1991, in Portree on the Isle of Skye. A preliminary proceedings was prepared in advance of the meeting. Most presentations were limited to a brief fifteen minutes, outlining the essentials of their subject, and referring the audience to the pre-print proceedings for details. Papers were then refereed and rewritten, and you hold the final results in your hands. A number of themes emerged at this year's workshop, including relational algebra and its application to hardware design, partial evaluation and program transformation, implementation techniques, and strictness analysis. We were especially pleased to see applications of functional programming emerge as a theme. One of the sessions was devoted to a lively discussion of applications, and was greatly enhanced by our industrial participants. The workshop was organised by Kei Davis, Cordelia Hall, Rogardt Heldal, Carsten Kehler Holst, John Hughes, John O'Donnell, and Satnam Singh all from the University of Glasgow.

This tutorial book presents an augmented selection of material presented at the International Summer School on Generative and Transformational Techniques in Software Engineering, GTTSE 2005. The book comprises 7 tutorial lectures presented together with 8 technology presentations and 6 contributions to the participants workshop. The tutorials combine foundations, methods, examples, and tool support. Subjects covered include feature-oriented programming and the AHEAD tool suite; program transformation with reflection and aspect-oriented programming, and more.

Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been succe- fully applied to a wide variety of real-world situations including database m- agement, active networks, software engineering, and decision-support systems. New developments in theory and implementation expose fresh opportunities. At the same time, the application of declarative languages to novel problems raises numerous interesting research issues. These well-known questions include scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and imp- mentation of declarative systems, and in turn bene?t from this progress. The International Symposium on Practical Applications of Declarative L- guages (PADL) provides a forum for researchers, practitioners, and implementors of declarative languages to exchange ideas on current and novel application - eas and on the requirements for e?ective use of declarative systems. The fourth PADL symposium was held in Portland, Oregon, on January 19 and 20, 2002.

Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others. The area of graph grammars and graph transformations generalizes formal language theory based on strings and the theory of term rewriting based on trees. As a matter of fact, within the area of graph grammars, graph transformation is considered a fundamental computation paradigm where computation includes specification, programming, and implementation. Over the last three decades, graph grammars have developed at a steady pace into a theoretically attractive and important-for-applications research field. Volume 2 of the indispensable Handbook of Graph Grammars and Computing by Graph Transformations considers applications to functional languages, visual and object-oriented languages, software engineering, mechanical engineering, chemical process engineering, and images. It also presents implemented specification languages and tools, and structuring and modularization concepts for specification languages. The contributions have been written in a tutorial/survey style by the top experts in the corresponding areas. This volume is accompanied by a CD-Rom containing implementations of specification environments based on graphtransformation systems, and tools whose implementation is based on the use of graph transformation systems.

The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines.