Intersection and union types: Syntax and semantics
From MaRDI portal
Publication:1893736
DOI10.1006/inco.1995.1086zbMath0832.68065OpenAlexW1990370351MaRDI QIDQ1893736
Franco Barbanera, Ugo de'Liguoro, Mariangiola Dezani-Ciancaglini
Publication date: 2 August 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1086
Related Items
Soundness Conditions for Big-Step Semantics, Infinite intersection types, A Realizability Interpretation for Intersection and Union Types, Combinatory logic and the semantics of substructural logics, Unnamed Item, The ``relevance of intersection and union types, Singleton, union and intersection types for program extraction, Typed generic traversal with term rewriting strategies, Union and intersection types to support both dynamic and static typing, Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\), A binary modal logic for the intersection types of lambda-calculus., The semantics of entailment omega, Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca, Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage, A Type Theory for Probabilistic $$\lambda $$–calculus, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Idealized coinductive type systems for imperative object-oriented programs, A Filter Model for the λμ-Calculus, Deriving session and union types for objects, The vectorial \(\lambda\)-calculus, On the unity of duality, Cut Elimination in a Class of Sequent Calculi for Pure Type Systems, Unnamed Item, Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models, Completeness of type assignment systems with intersection, union, and type quantifiers, Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification?, A descriptive type foundation for RDF Schema, On the Values of Reducibility Candidates, Type Inference by Coinductive Logic Programming, The Relevance of Semantic Subtyping, Discrimination by parallel observers: the algorithm., Taming the Merge Operator, Minimal type inference for linked data consumers, A note on subject reduction in \((\to, \exists)\)-Curry with respect to complete developments, Isomorphism of intersection and union types, Combining type disciplines, Elaborating intersection and union types
