Games characterizing Levy-Longo trees
type: Item
instance of: scholarly article
title: Games characterizing Levy-Longo trees
zbMATH Open document ID: 1094.91011
DOI: 10.1016/S0304-3975(03)00405-5
author: Yanyan Li
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
review text: A simple \textit{strongly universal} innocent game model for Lévy-Longo trees is presented: every point in the model is the denotation of a unique Lévy-Longo tree. The observational quotient of the model then gives a universal, and hence fully abstract, model of the pure Lazy Lambda Calculus.
reviewed by: Jérôme Renault
Mathematics Subject Classification ID: 91A40
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 2110973
zbMATH Keywords: game semantics
zbMATH Keywords: Lambda calculus
zbMATH Keywords: arenas
zbMATH Keywords: universality
zbMATH Keywords: full abstraction
MaRDI profile type: Publication
cites work: Full abstraction for PCF
cites work: Full abstraction in the lazy lambda calculus
cites work: Q3342534
cites work: Q4783308
cites work: Q2778818
cites work: Q4263866
cites work: On full abstraction for PCF: I, II and III
cites work: Q4945241
cites work: Innocent game models of untyped \(\lambda\)-calculus
cites work: Q4101795
cites work: Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus
full work available at URL: s0304-3975(03)00405-5
OpenAlex ID: W1483887233
description: scientific article; zbMATH DE number 2110973