Games characterizing Levy-Longo trees

DOI10.1016/S0304-3975(03)00405-5zbMATH Open1094.91011OpenAlexW1483887233MaRDI QIDQ1884875FDOQ1884875

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2086645
• Publication:4945241
• Adapting innocent game models for the Böhm tree \(\lambda\)-theory
• scientific article; zbMATH DE number 2080222
• Innocent game models of untyped \(\lambda\)-calculus

zbMATH Keywords

full abstractiongame semanticsuniversalityLambda calculusarenas

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Eager functions as processes
• The eigen-distribution of weighted game trees
• Trees and Ehrenfeucht-Fraïssé games
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884875)