Intersection types and computational rules

DOI10.1016/S1571-0661(04)80843-0MaRDI QIDQ4924527zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Intersection types and lambda models
• Intersection types for combinatory logic
• The untyped computational \(\lambda \)-calculus and its intersection type discipline
• A classification of intersection type systems
• Intersection types and λ-definability

Cites work

• 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
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Combinatory logic. With two sections by William Craig.
• Domain theory in logical form
• Explicit substitutions
• Full abstraction in the lazy lambda calculus
• Functional Characters of Solvable Terms
• scientific article; zbMATH DE number 3889502 (Why is no real title available?)
• scientific article; zbMATH DE number 3706504 (Why is no real title available?)
• scientific article; zbMATH DE number 92599 (Why is no real title available?)
• scientific article; zbMATH DE number 1332643 (Why is no real title available?)
• scientific article; zbMATH DE number 1333599 (Why is no real title available?)
• scientific article; zbMATH DE number 2003154 (Why is no real title available?)
• scientific article; zbMATH DE number 2044491 (Why is no real title available?)
• scientific article; zbMATH DE number 1759417 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• Semantical analysis of perpetual strategies in -calculus
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Simple easy terms
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models

Cited in

(12)

• Intersection type assignment systems
• Intersection types and lambda models
• Logical semantics for stability
• Type preorders and recursive terms
• Disjoint intersection types
• scientific article; zbMATH DE number 1929308 (Why is no real title available?)
• scientific article; zbMATH DE number 1841834 (Why is no real title available?)
• lambda!-calculus, Intersection Types, and Involutions
• Intersection and union types
• scientific article; zbMATH DE number 6744146 (Why is no real title available?)
• Intersection types in Java: back to the future
• Type interaction models and the rule of six

This page was built for publication: Intersection types and computational rules

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