Intersection Types and Computational Rules

DOI10.1016/S1571-0661(04)80843-0zbMath1264.03045OpenAlexW2081367192MaRDI QIDQ4924527

Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini

Publication date: 6 June 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)80843-0

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (1)

Intersection types and lambda models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• An extension of basic functionality theory for \(\lambda\)-calculus
• Algebras and combinators
• Domain theory in logical form
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Full abstraction in the lazy lambda calculus
• Semantical analysis of perpetual strategies in \(\lambda\)-calculus
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Simple Easy Terms
• A filter lambda model and the completeness of type assignment
• Functional Characters of Solvable Terms
• Explicit substitutions

This page was built for publication: Intersection Types and Computational Rules