The interpretation of unsolvable λ-terms in models of untyped λ-calculus

DOI10.2307/2586665zbMath0930.03013OpenAlexW1498846607MaRDI QIDQ4254697

Rainer Kerth

Publication date: 15 February 2000

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2586665

zbMATH Keywords

graph modelsstable modelsdecorationcritical sequenceinterpretation of unsolvable \(\lambda\)-terms in a given model of \(\lambda\)-calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (4)

Easiness in graph models ⋮ On the construction of stable models of untyped \(\lambda\)-calculus ⋮ Effective λ-models versus recursively enumerable λ-theories ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• The system \({\mathcal F}\) of variable types, fifteen years later
• Algebras and combinators
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Isomorphism and equational equivalence of continuous \(\lambda\)-models
• Lambda‐Calculus Models and Extensionality
• Data Types as Lattices
• Approximate Reduction and Lambda Calculus Models
• What is a model of the lambda calculus?
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus

This page was built for publication: The interpretation of unsolvable λ-terms in models of untyped λ-calculus