Union Types with Disjoint Switches (Artifact)

Authors Baber Rehman , Xuejing Huang , Ningning Xie, Bruno C. d. S. Oliveira

Thumbnail PDF

Artifact Description

  • Filesize: 0.57 MB
  • 6 pages

Document Identifiers

Author Details

Baber Rehman
  • The University of Hong Kong, China
Xuejing Huang
  • The University of Hong Kong, China
Ningning Xie
  • University of Cambridge, UK
Bruno C. d. S. Oliveira
  • The University of Hong Kong, China


We thank the anonymous reviewers for their helpful and constructive comments.

Cite AsGet BibTex

Baber Rehman, Xuejing Huang, Ningning Xie, and Bruno C. d. S. Oliveira. Union Types with Disjoint Switches (Artifact). In Special Issue of the 36th European Conference on Object-Oriented Programming (ECOOP 2022). Dagstuhl Artifacts Series (DARTS), Volume 8, Issue 2, pp. 17:1-17:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Artifact Evaluation Policy

The artifact has been evaluated as described in the ECOOP 2022 Call for Artifacts and the ACM Artifact Review and Badging Policy


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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Type theory
  • Union types
  • switch expression
  • disjointness
  • intersection types


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads