Abstract
In the λ-calculus there are plenty of programs (or λ-terms) where it is possible to apply the reduction rule β, introduced in 1.3.4, in more than one position. The λ-calculus does not specify a unique evaluation order, or reduction strategy, that associates to each program or term a unique position where the reduction will proceed.
This is a preview of subscription content, log in via an institution to check access.
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
© 1995 Birkhäuser Boston
About this chapter
Cite this chapter
Di Cosmo, R. (1995). Confluence Results. In: Isomorphisms of Types. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-2572-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2572-0_2
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7585-5
Online ISBN: 978-1-4612-2572-0
eBook Packages: Springer Book Archive