Intersection, Universally Quantified, and Reference Types

DOI10.1007/978-3-642-04027-6_17zbMath1257.03039OpenAlexW1481698781MaRDI QIDQ3644750

Mariangiola Dezani-Ciancaglini, Paola Giannini, Simonetta Ronchi della Rocca

Publication date: 12 November 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04027-6_17

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

Quantitative global memory ⋮ Intersection, Universally Quantified, and Reference Types

Cites Work

• Unnamed Item
• Unnamed Item
• Polymorphic type inference and containment
• An extension of basic functionality theory for \(\lambda\)-calculus
• Typability and type checking in System F are equivalent and undecidable
• A syntactic approach to type soundness
• The subtyping problem for second-order types is undecidable.
• Intersection types and computational effects
• Intersection, Universally Quantified, and Reference Types
• Principal Typing in a ∀Λ-Discipline