Topological incompleteness and order incompleteness of the lambda calculus
From MaRDI portal
Publication:5267435
DOI10.1145/772062.772067zbMATH Open1407.03014OpenAlexW1991093042MaRDI QIDQ5267435FDOQ5267435
Publication date: 13 June 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10278/13809
Recommendations
- Towards lambda calculus order-incompleteness
- scientific article; zbMATH DE number 4087629
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- Ordered models of the lambda calculus
lambda calculustopological modelspartially ordered modelslambda theoriesorder and topological incompletenessorderability/unorderability
Cited In (11)
- Effective λ-models versus recursively enumerable λ-theories
- a-Logic With Arrows
- Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- On the completeness of order-theoretic models of the \(\lambda \)-calculus
- Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
- Title not available (Why is that?)
- Order-incompleteness and finite lambda reduction models
- Easiness in graph models
- Easy lambda-terms are not always simple
- Graph lambda theories
This page was built for publication: Topological incompleteness and order incompleteness of the lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267435)
