Ebook: The Parametric Lambda Calculus: A Metamodel for Computation
- Genre: Mathematics // Logic
- Tags: Mathematical Logic and Formal Languages, Programming Languages Compilers Interpreters, Computation by Abstract Devices, Logics and Meanings of Programs, Artificial Intelligence (incl. Robotics)
- Series: Texts in Theoretical Computer Science. An EATCS Series
- Year: 2004
- Publisher: Springer
- Language: English
- pdf
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.
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.
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.
Content:
Front Matter....Pages I-XIII
Front Matter....Pages 1-1
The Parametric ?-Calculus....Pages 3-23
The Call-by-Name ?-Calculus....Pages 25-33
The Call-by-Value ?-Calculus....Pages 35-59
Further Reading....Pages 61-61
Front Matter....Pages 63-63
Parametric Operational Semantics....Pages 65-72
Call-by-Name Operational Semantics....Pages 73-88
Call-by-Value Operational Semantics....Pages 89-94
Operational Extensionality....Pages 95-100
Further Reading....Pages 101-101
Front Matter....Pages 103-103
??-Models....Pages 105-117
Call-by-Name Denotational Semantics....Pages 119-179
Call-by-Value Denotational Semantics....Pages 181-206
Filter ??-Models and Domains....Pages 207-219
Further Reading....Pages 221-222
Front Matter....Pages 223-223
Preliminaries....Pages 225-231
Representing Functions....Pages 233-240
Back Matter....Pages 241-254
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.
Content:
Front Matter....Pages I-XIII
Front Matter....Pages 1-1
The Parametric ?-Calculus....Pages 3-23
The Call-by-Name ?-Calculus....Pages 25-33
The Call-by-Value ?-Calculus....Pages 35-59
Further Reading....Pages 61-61
Front Matter....Pages 63-63
Parametric Operational Semantics....Pages 65-72
Call-by-Name Operational Semantics....Pages 73-88
Call-by-Value Operational Semantics....Pages 89-94
Operational Extensionality....Pages 95-100
Further Reading....Pages 101-101
Front Matter....Pages 103-103
??-Models....Pages 105-117
Call-by-Name Denotational Semantics....Pages 119-179
Call-by-Value Denotational Semantics....Pages 181-206
Filter ??-Models and Domains....Pages 207-219
Further Reading....Pages 221-222
Front Matter....Pages 223-223
Preliminaries....Pages 225-231
Representing Functions....Pages 233-240
Back Matter....Pages 241-254
....