On combinatory algebras and their expansions
From MaRDI portal
Publication:760416
DOI10.1016/0304-3975(84)90123-3zbMATH Open0555.03006OpenAlexW2016890450MaRDI QIDQ760416FDOQ760416
Authors: Kim B. Bruce, Giuseppe Longo 
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90123-3
Recommendations
Cites Work
- Title not available (Why is that?)
- Computable functionals of finite types
- Data Types as Lattices
- Algebras and combinators
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- The lambda calculus, its syntax and semantics
- Title not available (Why is that?)
- Lambda‐Calculus Models and Extensionality
- What is a model of the lambda calculus?
- Models of the lambda calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Collapsing partial combinatory algebras
- A Note on Absolutely Unorderable Combinatory Algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computability in higher types, P\(\omega\) and the completeness of type assignment
- Title not available (Why is that?)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
- A category-theoretic characterization of functional completeness
- Title not available (Why is that?)
- On flexible composition algebras
- Extending partial combinatory algebras
This page was built for publication: On combinatory algebras and their expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760416)
