The Parametric Lambda Calculus

A Metamodel for Computation

Simona Ronchi Della Rocca, Luca Paolini (Autoren)

Buch | Softcover

XIV, 248 Seiten

2010 | 1. Softcover reprint of hardcover 1st ed. 2004
Springer Berlin (Verlag)
978-3-642-05746-5 (ISBN)

Artikel merken

The A-calculus was invented by Church in the 1930s with the purpose of sup plying a logical foundation for logic and mathematics [25]. Its use by Kleene as a coding for computable functions makes it the first programming lan guage, in an abstract sense, exactly as the Thring machine can be considered the first computer machine [57]. The A-calculus has quite a simple syntax (with just three formation rules for terms) and a simple operational seman tics (with just one operation, substitution), and so it is a very basic setting for studying computation properties. The first contact between A-calculus and real programming languages was in the years 1956-1960, when McCarthy developed the LISP programming language, inspired from A-calculus, which is the first "functional" program ming language, Le., where functions are first-dass citizens [66]. But the use of A-calculus as an abstract paradigm for programming languages started later as the work of three important scientists: Strachey, Landin and B6hm.

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. .

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.

Erscheint lt. Verlag	4.12.2010
Reihe/Serie	Texts in Theoretical Computer Science. An EATCS Series
Zusatzinfo	XIV, 248 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	415 g
Themenwelt	Mathematik / Informatik ► Informatik
Themenwelt	Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika
Schlagworte	Artificial Intelligence • Computational Models • Denotational Semantics • Formal Languages • Lambda Calculi • Lambda Calculus • Mathematical Logic • Operational Semantics • Programming Languages • Semantics • Syntax • theoretical computer science
ISBN-10	3-642-05746-2 / 3642057462
ISBN-13	978-3-642-05746-5 / 9783642057465
Zustand	Neuware