Operational, denotational and logical descriptions: a case study
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Full abstraction in the lazy lambda calculus
Information and Computation
Innocent game models of untyped λ-calculus
Theoretical Computer Science - Special issue on theories of types and proofs
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Games and Full Abstraction for the Lazy Lambda-Calculus
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Games Characterizing Levy-Longo Trees
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Electronic Notes in Theoretical Computer Science (ENTCS)
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 |
In this paper we present a fully abstract game model for the pure lazy λ-calculus, i.e. the lazy λ-calculus without constants. In order to obtain this result we introduce a new category of games, the monotonic games, whose main characteristic consists in having an order relation on moves.