Ordered models of the lambda calculus
From MaRDI portal
Abstract: Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model with bottom element. We also relate the subtractive equations to the open problem of the order-incompleteness of lambda calculus, by studying the connection between the notion of absolute unorderability in a specific point and a weaker notion of subtractivity (namely n-subtractivity) for partially ordered algebras. Finally we study the relation between n-subtractivity and relativized separation conditions in topological algebras, obtaining an incompleteness theorem for a general topological semantics of lambda calculus.
Recommendations
- On the equational consistency of order-theoretic models of the lambda-calculus
- Towards lambda calculus order-incompleteness
- Topological incompleteness and order incompleteness of the lambda calculus
- Order-incompleteness and finite lambda reduction models
- On the completeness of order-theoretic models of the \(\lambda \)-calculus
Cited in
(8)- A Note on Absolutely Unorderable Combinatory Algebras
- On the equational consistency of order-theoretic models of the lambda-calculus
- Topological incompleteness and order incompleteness of the lambda calculus
- scientific article; zbMATH DE number 4051567 (Why is no real title available?)
- On the completeness of order-theoretic models of the \(\lambda \)-calculus
- Order-incompleteness and finite lambda reduction models
- Towards lambda calculus order-incompleteness
- Order-enriched categorical models of the classical sequent calculus
This page was built for publication: Ordered models of the lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2871473)
