Easy lambda-terms are not always simple

DOI10.1051/ITA/2012005zbMATH Open1253.03035OpenAlexW1980508492MaRDI QIDQ2889181FDOQ2889181

Antonino Salibra, Alberto Carraro

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

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

zbMATH Keywords

lambda calculusfilter modelseasy lambda termsris modelssimple easy lambda terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

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)