Graph lambda theories

DOI10.1017/S0960129508006683MaRDI QIDQ3535680zbMATH OpenFDO

Authors Antonio Bucciarelli, Antonino Salibra

Publication date 13 November 2008

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0960129508006683

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Mathematical Foundations of Computer Science 2003
• Graph models of $\lambda$-calculus at work, and variations
• Lambda Theories of Effective Lambda Models
• Minimal -theories by ultraproducts
• Easiness in graph models

Cites work

• A filter lambda model and the completeness of type assignment
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• An extension of basic functionality theory for -calculus
• Domain theory in logical form
• Easiness in graph models
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Graph models of $\lambda$-calculus at work, and variations
• Isomorphism and equational equivalence of continuous \(\lambda\)-models
• Not Enough Points Is Enough
• On the construction of stable models of untyped -calculus
• Order-incompleteness and finite lambda reduction models
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Topological incompleteness and order incompleteness of the lambda calculus

Cited in

(16)

• Isomorphism and equational equivalence of continuous \(\lambda\)-models
• Relational graph models, Taylor expansion and extensionality
• Graph easy sets of mute lambda terms
• Lambda Theories of Effective Lambda Models
• Effective λ-models versus recursively enumerable λ-theories
• The interpretation of unsolvable λ-terms in models of untyped λ-calculus
• scientific article; zbMATH DE number 599151 (Why is no real title available?)
• scientific article; zbMATH DE number 1546504 (Why is no real title available?)
• scientific article; zbMATH DE number 1547155 (Why is no real title available?)
• Relational graph models at work
• scientific article; zbMATH DE number 1424050 (Why is no real title available?)
• Minimal -theories by ultraproducts
• Solution of a Problem of Barendregt on Sensible lambda-Theories
• New results on Morris's observational theory: the benefits of separating the inseparable
• Mathematical Foundations of Computer Science 2003
• Graph models of $\lambda$-calculus at work, and variations

This page was built for publication: Graph lambda theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535680)