Towards Lambda Calculus Order-Incompleteness
From MaRDI portal
Publication:4916175
DOI10.1016/S1571-0661(04)00170-7zbMath1261.03076OpenAlexW2002993322MaRDI QIDQ4916175
Publication date: 19 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(04)00170-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lambda abstraction algebras: representation theorems
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Topological implications in n-permutable varieties
- The system \({\mathcal F}\) of variable types, fifteen years later
- Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
- Algebras and combinators
- Domain theory in logical form
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Full abstraction in the lazy lambda calculus
- Topological equivalents to \(n\)-permutability
- A finite equational axiomatization of the functional algebras for the lambda calculus
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Isomorphism and equational equivalence of continuous \(\lambda\)-models
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- On the algebraic models of lambda calculus
- Order-incompleteness and finite lambda reduction models
- The abstract variable-binding calculus
- Separation in topological algebras
- On a question of H. Friedman
- A filter lambda model and the completeness of type assignment
- Data Types as Lattices
- Varieties Obeying Homotopy Laws
- Localisation and interaction in one dimension
- What is a model of the lambda calculus?
- Topological implications in varieties
- On the construction of stable models of untyped \(\lambda\)-calculus
This page was built for publication: Towards Lambda Calculus Order-Incompleteness