Union Types with Disjoint Switches (Artifact)

Autor:	Rehman, Baber, Huang, Xuejing, Xie, Ningning, Oliveira, Bruno C. d. S.
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Union types TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Computer Science::Logic in Computer Science intersection types Computer Science::Programming Languages disjointness switch expression Theory of computation → Type theory
DOI:	10.4230/darts.8.2.17
Popis:	This artifact contains the mechanical formalization of the calculi associated with the paper Union Types with Disjoint Switches. All of the metatheory has been formalized in Coq theorem prover. We provide a docker image as well the code archive. The paper studies a union calculus ({λ_{u}}). Primary idea of {λ_{u}} calculus is a type based disjoint switch construct for the elimination of union types. We also study several extensions of the {λ_{u}} calculus including intersection types, distributive subtyping, nominal types, parametric polymorphism and an extension for the empty types. DARTS, Vol. 8, Special Issue of the 36th European Conference on Object-Oriented Programming (ECOOP 2022), pages 17:1-17:6
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::fee1940dee8fe219c728d84775f2ac34 Zobrazit plný text záznamu