Graph lambda theories
From MaRDI portal
Publication:3535680
DOI10.1017/S0960129508006683zbMath1158.03008MaRDI QIDQ3535680
Antonio Bucciarelli, Antonino Salibra
Publication date: 13 November 2008
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Related Items (3)
Graph easy sets of mute lambda terms ⋮ Unnamed Item ⋮ Effective λ-models versus recursively enumerable λ-theories
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
- An extension of basic functionality theory for \(\lambda\)-calculus
- Domain theory in logical form
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Isomorphism and equational equivalence of continuous \(\lambda\)-models
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Order-incompleteness and finite lambda reduction models
- Easiness in graph models
- A filter lambda model and the completeness of type assignment
- Not Enough Points Is Enough
- Topological incompleteness and order incompleteness of the lambda calculus
- Graph models of $\lambda$-calculus at work, and variations
- On the construction of stable models of untyped \(\lambda\)-calculus
This page was built for publication: Graph lambda theories
