Games characterizing Levy-Longo trees

DOI10.1016/S0304-3975(03)00405-5zbMath1094.91011OpenAlexW1483887233MaRDI QIDQ1884875

Yanyan Li

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00405-5

zbMATH Keywords

universalityfull abstractiongame semanticsLambda calculusarenas

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Eager functions as processes

Cites Work

• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Full abstraction in the lazy lambda calculus
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Innocent game models of untyped \(\lambda\)-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Games characterizing Levy-Longo trees