Finite type structures within combinatory algebras
From MaRDI portal
Publication:1182485
DOI10.1016/0168-0072(91)90004-6zbMath0748.03011OpenAlexW2064861136WikidataQ126388420 ScholiaQ126388420MaRDI QIDQ1182485
Publication date: 28 June 1992
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(91)90004-6
Related Items (1)
Cites Work
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- The system \({\mathcal F}\) of variable types, fifteen years later
- \(\mathbb{T}^\omega\) as a universal domain
- The lambda calculus, its syntax and semantics
- Algebras and combinators
- Reducibilities in two models for combinatory logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finite type structures within combinatory algebras