Games characterizing Levy-Longo trees

Authors:
C.-H. L. Ong;P. Di Gianantonio
Affiliations:
Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, United Kingdom;Dipartimento di Matematica e Informatica, Università di Udine, via delle Scienze, 206, 33100 Udine, Italy
Venue:
Theoretical Computer Science - Special issue on automata, languages and programming
Year:
2004

Citing 7
Cited 1

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
An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
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

Typed normal form bisimulation

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

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.