Graph easy sets of mute lambda terms

DOI10.1016/j.tcs.2015.12.024zbMath1432.03020OpenAlexW2210507148MaRDI QIDQ288793

G. Favro, Antonino Salibra, Antonio Bucciarelli, Alberto Carraro

Publication date: 27 May 2016

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.024

zbMATH Keywords

forcinglambda-calculusgraph modelsmute terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (1)

A class of bounded functions, a database language and an extended lambda calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Some new results on easy lambda-terms
• Isomorphism and equational equivalence of continuous \(\lambda\)-models
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Consistency of a \(\lambda\)-theory with \(n\)-tuples and easy term
• Easiness in graph models
• Simple Easy Terms
• Easy lambda-terms are not always simple
• Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
• A filter lambda model and the completeness of type assignment
• Graph lambda theories
• Not Enough Points Is Enough
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• Mathematical Foundations of Computer Science 2003
• Graph models of $\lambda$-calculus at work, and variations
• The þ-function in λ-K-conversion

This page was built for publication: Graph easy sets of mute lambda terms