Intersection and union types

DOI10.1007/3-540-54415-1_69zbMath1493.68080OpenAlexW1501258188MaRDI QIDQ5096243

Mariangiola Dezani-Ciancaglini, Franco Barbanera

Publication date: 16 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-54415-1_69

Mathematics Subject Classification ID

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

Related Items

Infinite intersection types, Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca, The Relevance of Semantic Subtyping, Verifying Whiley programs with Boogie

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• The foundations of mathematics. A study in the philosophy of science
• Coppo-Dezani types do not correspond to propositional logic
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Kripke-style models for typed lambda calculus
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• Domain theory in logical form
• The completeness theorem for typing lambda-terms
• A completeness theorem in modal logic
• A filter lambda model and the completeness of type assignment
• Characterization theorems for a filter lambda model
• An ideal model for recursive polymorphic types
• Functional Characters of Solvable Terms
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• What is a model of the lambda calculus?