Order-incompleteness and finite lambda reduction models

DOI10.1016/S0304-3975(02)00038-5zbMath1070.68022MaRDI QIDQ1884896

Peter Selinger

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

untyped lambda calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items

Easiness in graph models, Graph lambda theories, Unnamed Item, A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language, Towards Lambda Calculus Order-Incompleteness, A typed, algebraic, computational lambda-calculus, On the completeness of order-theoretic models of the \(\lambda \)-calculus, Effective λ-models versus recursively enumerable λ-theories, Skew confluence and the lambda calculus with letrec

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• The system \({\mathcal F}\) of variable types, fifteen years later
• Filter models with polymorphic types
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• A semantics for static type inference
• On a question of H. Friedman
• On \(n\)-permutable congruences
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item