Innocent game models of untyped -calculus

DOI10.1016/S0304-3975(00)00353-4MaRDI QIDQ5958298zbMATH OpenOpenAlexFDO

Authors Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong

Publication date 3 March 2002

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

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00353-4

zbMATH Keywords

game semanticsinnocent strategiesuntyped-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1342276
• Model-checking games for typed -calculi
• Game semantics and uniqueness of type inhabitance in the simply-typed -calculus
• scientific article; zbMATH DE number 1722650
• Innocent game semantics via intersection type assignment systems
• scientific article; zbMATH DE number 1223630
• scientific article; zbMATH DE number 7340562
• Bounded game-theoretic semantics for modal mu-calculus
• On the construction of stable models of untyped -calculus

Cites work

• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Categories for Types
• scientific article; zbMATH DE number 3550683 (Why is no real title available?)
• scientific article; zbMATH DE number 1342276 (Why is no real title available?)
• scientific article; zbMATH DE number 1479606 (Why is no real title available?)
• scientific article; zbMATH DE number 937379 (Why is no real title available?)
• scientific article; zbMATH DE number 1424050 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• scientific article; zbMATH DE number 3400430 (Why is no real title available?)
• Infinitary lambda calculus
• Innocent game models of untyped -calculus
• On full abstraction for PCF: I, II and III
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus

Cited in

(19)

• On full abstraction for PCF: I, II and III
• Games characterizing Levy-Longo trees
• Adapting innocent game models for the Böhm tree \(\lambda\)-theory
• Evaluating lambda terms with traversals
• scientific article; zbMATH DE number 1722650 (Why is no real title available?)
• Processes and games
• Model-checking games for typed -calculi
• The lambda -bar calculus, a dual calculus for unconstrained strategies
• Game semantics and uniqueness of type inhabitance in the simply-typed -calculus
• scientific article; zbMATH DE number 1223630 (Why is no real title available?)
• scientific article; zbMATH DE number 1342276 (Why is no real title available?)
• scientific article; zbMATH DE number 1424050 (Why is no real title available?)
• Fully abstract models of the probabilistic -calculus
• Innocent game models of untyped -calculus
• From thin concurrent games to generalized species of structures (extended version)
• Extensional and non-extensional functions as processes
• Extensional Taylor expansion
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
• Interaction improvement

This page was built for publication: Innocent game models of untyped \(\lambda\)-calculus

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