Simple Easy Terms

DOI10.1016/S1571-0661(04)80487-0zbMath1270.03028OpenAlexW2043749339MaRDI QIDQ2842831

Fabio Alessi, Stefania Lusin

Publication date: 16 August 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80487-0

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items

Easy lambda-terms are not always simple, Graph easy sets of mute lambda terms, Easiness in graph models, Intersection types and lambda models, Intersection types and domain operators, Intersection Types and Computational Rules

Cites Work

• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• An extension of basic functionality theory for \(\lambda\)-calculus
• Domain theory in logical form
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Full abstraction in the lazy lambda calculus
• Semantical analysis of perpetual strategies in \(\lambda\)-calculus
• Some new results on easy lambda-terms
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• On the Jacopini technique
• A filter lambda model and the completeness of type assignment
• Lambda‐Calculus Models and Extensionality
• The call-by-value λ-calculus: a semantic investigation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item