Innocent game models of untyped λ-calculus
Theoretical Computer Science - Special issue on theories of types and proofs
Games Characterizing Levy-Longo Trees
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Fine Structure of Game Lambda Models
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Games and Full Abstraction for FPC
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Adapting innocent game models for the Böhm tree λ-theory
Theoretical Computer Science
Games characterizing Levy-Longo trees
Theoretical Computer Science - Special issue on automata, languages and programming
Functions with local state: regularity and undecidability
Theoretical Computer Science
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Game semantics for the pure lazy λ-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A fully abstract bidomain model of unary FPC
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
| Hi-index | 0.00 |
We define a category of games G, and its extensional quotient E. A model of the lazy lambda-calculus, a type-free functional language based on evaluation to weak head normal form, is given in G, yielding an extensional model in E. This model is shown to be fully abstract with respect to applicative simulation. This is, so far as we know, the first purely semantic construction of a fully abstract model for a reflexively-typed sequential language.