Easy lambda-terms are not always simple

DOI10.1051/ITA/2012005MaRDI QIDQ2889181zbMATH OpenOpenAlexFDO

Authors Alberto Carraro, Antonino Salibra

Publication date 4 June 2012

Published in RAIRO. Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/222014, http://hdl.handle.net/10278/36003

zbMATH Keywords

lambda calculusfilter modelseasy lambda termsris modelssimple easy lambda terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• scientific article; zbMATH DE number 23772
• Marginalia to a theorem of Jacopini
• Some new results on easy lambda-terms
• scientific article; zbMATH DE number 3916224
• Simple easy terms

Cites work

• scientific article; zbMATH DE number 3648679 (Why is no real title available?)
• scientific article; zbMATH DE number 3889502 (Why is no real title available?)
• scientific article; zbMATH DE number 3916224 (Why is no real title available?)
• scientific article; zbMATH DE number 3672266 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 23772 (Why is no real title available?)
• scientific article; zbMATH DE number 3503200 (Why is no real title available?)
• scientific article; zbMATH DE number 3556025 (Why is no real title available?)
• scientific article; zbMATH DE number 3594646 (Why is no real title available?)
• scientific article; zbMATH DE number 2044491 (Why is no real title available?)
• scientific article; zbMATH DE number 937379 (Why is no real title available?)
• A filter lambda model and the completeness of type assignment
• Algebras and combinators
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• An extension of basic functionality theory for -calculus
• Easiness in graph models
• Effective λ-models versus recursively enumerable λ-theories
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Graph models of $\lambda$-calculus at work, and variations
• Intersection types and domain operators
• Isomorphism and equational equivalence of continuous \(\lambda\)-models
• Models of the lambda calculus
• On the Jacopini technique
• On the construction of stable models of untyped \(\lambda\)-calculus
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Simple easy terms
• Some new results on easy lambda-terms
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Topological incompleteness and order incompleteness of the lambda calculus
• What is a model of the lambda calculus?

Cited in

(7)

• scientific article; zbMATH DE number 23772 (Why is no real title available?)
• scientific article; zbMATH DE number 3916224 (Why is no real title available?)
• Graph easy sets of mute lambda terms
• Consistency of a \(\lambda\)-theory with \(n\)-tuples and easy term
• On sets of terms having a given intersection type
• No solvable lambda-value term left behind
• Simple easy terms

This page was built for publication: Easy lambda-terms are not always simple

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