Pages that link to "Item:Q1884896"
From MaRDI portal
The following pages link to Order-incompleteness and finite lambda reduction models (Q1884896):
Displaying 11 items.
- An alternate proof of Statman's finite completeness theorem (Q436624) (← links)
- On the completeness of order-theoretic models of the \(\lambda \)-calculus (Q1021569) (← links)
- Skew confluence and the lambda calculus with letrec (Q1849854) (← links)
- Easiness in graph models (Q2368937) (← links)
- A transfinite Knuth-Bendix order for lambda-free higher-order terms (Q2405268) (← links)
- Ordered models of the lambda calculus (Q2871473) (← links)
- A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language (Q3011126) (← links)
- Graph lambda theories (Q3535680) (← links)
- Effective λ-models versus recursively enumerable λ-theories (Q3643360) (← links)
- Towards Lambda Calculus Order-Incompleteness (Q4916175) (← links)
- A typed, algebraic, computational lambda-calculus (Q4917199) (← links)