Adapting innocent game models for the Böhm tree \(\lambda\)-theory
From MaRDI portal
Publication:1884886
DOI10.1016/S0304-3975(02)00849-6zbMath1068.68042MaRDI QIDQ1884886
C.-H. Luke Ong, Andrew D. Ker, Hanno Nickau
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Full abstraction in the lazy lambda calculus
- Infinite \(\lambda\)-calculus and types
- Infinitary 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
- Unnamed Item
- Unnamed Item
This page was built for publication: Adapting innocent game models for the Böhm tree \(\lambda\)-theory