An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus

DOI10.1016/0022-0000(92)90040-PzbMath0763.03012OpenAlexW2074026916MaRDI QIDQ1198661

Simonetta Ronchi della Rocca, Furio Honsell

Publication date: 16 January 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(92)90040-p

zbMATH Keywords

completeness\(\lambda\)-calculustopological model\(\lambda\)-theoriesCartesian closed category of complete partial orders and Scott-continuous functionsreflexive object

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Combinatory logic and lambda calculus (03B40)

Related Items (28)

The interpretation of unsolvable λ-terms in models of untyped λ-calculus ⋮ Easy lambda-terms are not always simple ⋮ Easiness in graph models ⋮ Intersection types and lambda models ⋮ Order-incompleteness and finite lambda reduction models ⋮ Graph lambda theories ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ An irregular filter model ⋮ Intersection types and domain operators ⋮ Towards Lambda Calculus Order-Incompleteness ⋮ Unfixing the Fixpoint: The Theories of the λY-Calculus ⋮ Intersection Types and Computational Rules ⋮ On the construction of stable models of untyped \(\lambda\)-calculus ⋮ Recursive Domain Equations of Filter Models ⋮ Call-by-value Solvability ⋮ Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness ⋮ 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 ⋮ Logical Semantics for Stability ⋮ Unnamed Item ⋮ On the completeness of order-theoretic models of the \(\lambda \)-calculus ⋮ Effective λ-models versus recursively enumerable λ-theories ⋮ Infinite \(\lambda\)-calculus and types ⋮ Semantical analysis of perpetual strategies in \(\lambda\)-calculus ⋮ Simple Easy Terms ⋮ Compositional characterisations of \(\lambda\)-terms using intersection types ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ Essential and relational models

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• LCF considered as a programming language
• A filter lambda model and the completeness of type assignment
• 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
• Approximate Reduction and Lambda Calculus Models

This page was built for publication: An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus