Easy lambda-terms are not always simple
From MaRDI portal
Publication:2889181
DOI10.1051/ita/2012005zbMath1253.03035OpenAlexW1980508492MaRDI QIDQ2889181
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
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- An extension of basic functionality theory for \(\lambda\)-calculus
- Algebras and combinators
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Some new results on easy lambda-terms
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- On the Jacopini technique
- 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
- Easiness in graph models
- Simple Easy Terms
- Models of the lambda calculus
- A filter lambda model and the completeness of type assignment
- Effective λ-models versus recursively enumerable λ-theories
- What is a model of the lambda calculus?
- Topological incompleteness and order incompleteness of the lambda calculus
- Graph models of $\lambda$-calculus at work, and variations
- On the construction of stable models of untyped \(\lambda\)-calculus
This page was built for publication: Easy lambda-terms are not always simple
