On the construction of stable models of untyped \(\lambda\)-calculus

DOI10.1016/S0304-3975(00)00371-6zbMath0992.68022MaRDI QIDQ5958611

Rainer Kerth

Publication date: 3 March 2002

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

zbMATH Keywords

calculussensibilitystable model

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (7)

Easy lambda-terms are not always simple ⋮ Easiness in graph models ⋮ Graph lambda theories ⋮ Towards Lambda Calculus Order-Incompleteness ⋮ Forcing in 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forcing in stable models of untyped \(\lambda\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The system \({\mathcal F}\) of variable types, fifteen years later
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Proceedings of the 3rd Scandinavian logic symposium
• LCF considered as a programming language
• Isomorphism and equational equivalence of continuous \(\lambda\)-models
• Lambda‐Calculus Models and Extensionality
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Data Types as Lattices
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Approximate Reduction and Lambda Calculus Models
• Degrees of sensible lambda theories
• The interpretation of unsolvable λ-terms in models of untyped λ-calculus
• What is a model of the lambda calculus?

This page was built for publication: On the construction of stable models of untyped \(\lambda\)-calculus