Final semantics for untyped λ-calculus
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 249-265
- https://doi.org/10.1007/bfb0014057
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A final coalgebra theoremPublished by Springer Nature ,2005
- Processes and hyperuniversesPublished by Springer Nature ,1994
- Full Abstraction in the Lazy Lambda CalculusInformation and Computation, 1993
- Some results on the full abstraction problem for restricted lambda calculiPublished by Springer Nature ,1993
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculusJournal of Computer and System Sciences, 1992
- Processes as terms: non-well-founded models for bisimulationMathematical Structures in Computer Science, 1992
- Operational and Algebraic Semantics of Concurrent ProcessesPublished by Elsevier ,1990
- Type theories, normal forms, and D∞-lambda-modelsInformation and Computation, 1987
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-CalculusSIAM Journal on Computing, 1976
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975