Game Semantics for Untyped λβη-Calculus
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 114-128
- https://doi.org/10.1007/3-540-48959-2_10
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Final semantics for untyped λ-calculusPublished by Springer Nature ,1995
- Games and full completeness for multiplicative linear logicThe Journal of Symbolic Logic, 1994
- Full Abstraction in the Lazy Lambda CalculusInformation and Computation, 1993
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculusJournal of Computer and System Sciences, 1992
- Domain theory in logical form*Annals of Pure and Applied Logic, 1991
- The system F of variable types, fifteen years laterTheoretical Computer Science, 1986
- Extended Type Structures and Filter Lambda ModelsPublished by Elsevier ,1984
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-CalculusSIAM Journal on Computing, 1976
- A Syntactic Characterization of the Equality in Some Models for the Lambda CalculusJournal of the London Mathematical Society, 1976