The Parametric Lambda Calculus: A Metamodel for Computation

ISBN-13: 9783540200321 / Angielski / Twarda / 2004 / 248 str.

Simona Ronchi Della Rocca; Luca Paolini; S. Ronchi Della Rocca

Opis

The book contains a completely new presentation of classical results in the field of Lambda Calculus, together with new results. The text is unique in that it presents a new calculus (Parametric Lambda Calculus) which can be instantiated to obtain already known lambda-calculi. Some properties, which in the literature have been proved separately for different calculi, can be proved once for the Parametric one. The lambda calculi are presented from a Computer Science point of view, with a particular emphasis on their semantics, both operational and denotational.

Spis treści

I. Syntax.- 1. The Parametric ?-Calculus.- 2. The Call-by-Name ?-Calculus.- 3. The Call-by-Value ?-Calculus.- 4. Further Reading.- II. Operational Semantics.- 5. Parametric Operational Semantics.- 6. Call-by-Name Operational Semantics.- 7. Call-by-Value Operational Semantics.- 8. Operational Extensionality.- 9. Further Reading.- III. Denotational Semantics.- 10. ??-Models.- 11. Call-by-Name Denotational Semantics.- 12. Call-by-Value Denotational Semantics.- 13. Filter ??-Models and Domains.- 14. Further Reading.- IV. Computational Power.- 15. Preliminaries.- 16. Representing Functions.

O autorze

Simona Ronchi Della Rocca: Full Professor of Foundations of Computer Science since 1987, Member of the Editorial Board of TOCL (ACM Transactions on Computational Logic), Member of the Organizing Committee of LICS (Logic in Computer Science), Member of the Accademy of Sciences of Torino

Luca Paolini: PhD student in Computer Science and Discrete Mathematics, Università di Genova and Université de la Mediterranée.

 

.

Blurb

The parametric lambda calculus is a metamodel for reasoning about various kinds of computations. Its syntactic definition is based on the notion of "sets of input values", and different lambda calculi can be obtained from it by instantiating such sets in suitable ways.

The parametric lambda calculus is used as a tool for presenting in a uniform way basic notions of programming languages, and for studying with a uniform approach some lambda calculi modeling different kinds of computations, such as call-by-name, both in its lazy and non-lazy versions, and call-by-value. The parametric presentation allows us both to prove in one step all the fundamental properties of different calculi, and to compare them with each other.

The book includes some classical results in the field of lambda calculi, but completely rephrased using the parametric approach, together with some new results. The lambda calculi are presented from a computer science viewpoint, with particular emphasis on their semantics, both operational and denotational.

This book is dedicated to researchers, and can be used as a textbook for masters or Ph.D. courses on the foundations of computer science.