Games Characterizing Levy-Longo Trees

Authors:
C.-H. Luke Ong;Pietro Di Gianantonio
Affiliations:
-;-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 10
Cited 2

Full abstraction in the lazy lambda calculus

Information and Computation
On full abstraction for PCF: I, II, and III

Information and Computation
Full abstraction for PCF

Information and Computation
Innocent game models of untyped λ-calculus

Theoretical Computer Science - Special issue on theories of types and proofs
Game Semantics for Untyped lambda beta eta-Calculus

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
A Universal Innocent Game Model for the Böhm Tree Lambda Theory

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
The Anatomy of Innocence

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Games and Full Abstraction for the Lazy Lambda-Calculus

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Game semantics for the pure lazy λ-calculus

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications

Adapting innocent game models for the Böhm tree λ-theory

Theoretical Computer Science
Game semantics and linear CPS interpretation

Theoretical Computer Science - Foundations of software science and computation structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple strongly universal innocent game model for Levy-Longo trees i.e. every point in the model is the denotation of a unique Levy-Longo tree. The observational quotient of the model then gives a universal, and hence fully abstract, model of the pure Lazy Lambda Calculus.