The interpretation of unsolvable λ-terms in models of untyped λ-calculus
From MaRDI portal
Publication:4254697
Recommendations
Cites work
- Algebras and combinators
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Approximate Reduction and Lambda Calculus Models
- Data Types as Lattices
- Isomorphism and equational equivalence of continuous \(\lambda\)-models
- Lambda‐Calculus Models and Extensionality
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The system \({\mathcal F}\) of variable types, fifteen years later
- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- What is a model of the lambda calculus?
Cited in
(8)- Theoretical Pearls:Representing ‘undefined’ in lambda calculus
- Graph easy sets of mute lambda terms
- On the construction of stable models of untyped \(\lambda\)-calculus
- scientific article; zbMATH DE number 937379 (Why is no real title available?)
- Effective λ-models versus recursively enumerable λ-theories
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- scientific article; zbMATH DE number 7340562 (Why is no real title available?)
- Easiness in graph models
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)