Easiness in graph models

DOI10.1016/j.tcs.2005.11.005zbMath1088.68034OpenAlexW2032766180MaRDI QIDQ2368937

Antonino Salibra, Chantal Berline

Publication date: 28 April 2006

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

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

zbMATH Keywords

Webbed modelsUntyped \(\lambda\)-calculusCombinatory algebrasLambda abstraction algebras

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Many-valued logic (03B50)

Related Items (4)

Easy lambda-terms are not always simple ⋮ Graph easy sets of mute lambda terms ⋮ Graph lambda theories ⋮ Effective λ-models versus recursively enumerable λ-theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lambda abstraction algebras: representation theorems
• 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
• Strong stability and the incompleteness of stable models 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
• Intersection types and domain operators
• Isomorphism and equational equivalence of continuous \(\lambda\)-models
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• On the algebraic models of lambda calculus
• Order-incompleteness and finite lambda reduction models
• Consistency of a \(\lambda\)-theory with \(n\)-tuples and easy term
• Simple Easy Terms
• A filter lambda model and the completeness of type assignment
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• The interpretation of unsolvable λ-terms in models of untyped λ-calculus
• The Lattice of Lambda Theories
• Topological incompleteness and order incompleteness of the lambda calculus
• Mathematical Foundations of Computer Science 2003
• On the construction of stable models of untyped \(\lambda\)-calculus

This page was built for publication: Easiness in graph models