Abstract
A calculus is a language equipped with some reduction rules. All the calculi we consider in this book share the same language, which is the language of λ-calculus, while they differ each other in their reduction rules. In order to treat them in an uniform way we define a parametric calculus, the λΔ-calculus, which gives rise to different calculi by different instantiations of the parameter Δ. In Part I we study the syntactical properties of the λΔ-calculus, and in particular those of its two most important instances, the call-by-name and the call-by-value λ-calculi. The λΔ-calculus has been introduced first in [85] and further studied in [74]. We use the terminology of [9].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rocca, S.R.D., Paolini, L. (2004). The Parametric λ-Calculus. In: The Parametric Lambda Calculus. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-10394-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-10394-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05746-5
Online ISBN: 978-3-662-10394-4
eBook Packages: Springer Book Archive