Abstract
After having studied CDS0 in the previous chapter, we return to a more classical programming language, where basic and functional data are different in behaviour: there are programs computing basic values, and procedures that cannot be evaluated by themselves, but only as part of a program. We focus on the language PCF, which is a typed λ-calculus with recursion and arithmetical constants. It has been studied by Plotkin [PloLCF] and Milner [MiFu]. The first section of this chapter is mainly devoted to their work.
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
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Curien, PL. (1993). The Full Abstraction Problem. In: Categorical Combinators, Sequential Algorithms, and Functional Programming. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0317-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0317-9_4
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6704-1
Online ISBN: 978-1-4612-0317-9
eBook Packages: Springer Book Archive