On the completeness of order-theoretic models of the \(\lambda \)-calculus

DOI10.1016/J.IC.2008.03.027zbMath1167.03013OpenAlexW1997705949MaRDI QIDQ1021569

Furio Honsell, Gordon D. Plotkin

Publication date: 8 June 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.027

zbMATH Keywords

consistencycompletenessdomain theory\(\lambda \)-calculusMal'tsev operators

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Unfixing the Fixpoint: The Theories of the λY-Calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Order-incompleteness and finite lambda reduction models
• On a question of H. Friedman
• Applying Universal Algebra to Lambda Calculus
• Lambda Theories of Effective Lambda Models
• Topological incompleteness and order incompleteness of the lambda calculus

This page was built for publication: On the completeness of order-theoretic models of the \(\lambda \)-calculus