Subtyping union types

DOI10.1007/978-3-540-30124-0_32MaRDI QIDQ5311273zbMATH OpenOpenAlexFDO

Authors Jérôme Vouillon

Publication date 22 August 2005

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

Full work available at URL https://doi.org/10.1007/b100120

zbMATH Keywords

lambda calculussemanticssubtypingunion types

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Subtyping with union types, intersection types and recursive types
• Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
• Subtyping can have a simple semantics
• Type assignment for intersections and unions in call-by-value languages
• Preciseness of subtyping on intersection and union types

Cited in

(13)

• Type soundness for path polymorphism
• Precise subtyping for synchronous multiparty sessions
• Typed path polymorphism
• Matching MyType to subtyping
• Type Fusion
• The recursive union of some gradual types
• Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
• Union types for semistructured data
• Subtyping with union types, intersection types and recursive types
• Efficient type checking for path polymorphism
• Semantic subtyping for non-strict languages
• Preciseness of subtyping on intersection and union types
• Theoretical Computer Science

This page was built for publication: Subtyping union types

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