Innocent game models of untyped \(\lambda\)-calculus
From MaRDI portal
Publication:5958298
DOI10.1016/S0304-3975(00)00353-4zbMath0992.68023OpenAlexW2014468489MaRDI QIDQ5958298
Andrew D. Ker, C.-H. Luke Ong, Hanno Nickau
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
Related Items
Games characterizing Levy-Longo trees, Adapting innocent game models for the Böhm tree \(\lambda\)-theory, Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus, Unnamed Item, Evaluating lambda terms with traversals, Unnamed Item, Innocent game models of untyped \(\lambda\)-calculus, Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness, On full abstraction for PCF: I, II and III
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Infinitary lambda calculus
- On full abstraction for PCF: I, II and III
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Categories for Types
- Innocent game models of untyped \(\lambda\)-calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
