The interpretation of unsolvable λ-terms in models of untyped λ-calculus
From MaRDI portal
Publication:4254697
DOI10.2307/2586665zbMATH Open0930.03013OpenAlexW1498846607MaRDI QIDQ4254697FDOQ4254697
Authors: 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
Recommendations
graph modelsstable modelsdecorationcritical sequenceinterpretation of unsolvable \(\lambda\)-terms in a given model of \(\lambda\)-calculus
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The system \({\mathcal F}\) of variable types, fifteen years later
- Data Types as Lattices
- Algebras and combinators
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Isomorphism and equational equivalence of continuous \(\lambda\)-models
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Approximate Reduction and Lambda Calculus Models
- Lambda‐Calculus Models and Extensionality
- What is a model of the lambda calculus?
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
Cited In (7)
- On the construction of stable models of untyped \(\lambda\)-calculus
- Effective λ-models versus recursively enumerable λ-theories
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Title not available (Why is that?)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Easiness in graph models
- Title not available (Why is that?)
This page was built for publication: The interpretation of unsolvable λ-terms in models of untyped λ-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254697)
