License: Creative Commons Attribution 3.0 Germany license (CC BY 3.0 DE)
When quoting this document, please refer to the following
DOI: 10.4230/DARTS.5.2.8
URN: urn:nbn:de:0030-drops-107855
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10785/
Go back to Dagstuhl Artifacts Series

Chung, Benjamin ; Nardelli, Francesco Zappa ; Vitek, Jan

On Julia's Efficient Algorithm for Subtyping Union Types and Covariant Tuples (Artifact)

pdf-format:
DARTS-5-2-8.pdf (0.3 MB)

Abstract

This is the artifact for the pearl paper "On Julia's efficient algorithm for subtyping union types and covariant tuples."

BibTeX - Entry

@Article{chung_et_al:DARTS:2019:10785,
  author =	{Benjamin Chung and Francesco Zappa Nardelli and Jan Vitek},
  title =	{{On Julia's Efficient Algorithm for Subtyping Union Types and Covariant Tuples (Artifact)}},
  pages =	{8:1--8:2},
  journal =	{Dagstuhl Artifacts Series},
  ISSN =	{2509-8195},
  year =	{2019},
  volume =	{5},
  number =	{2},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10785},
  doi =		{10.4230/DARTS.5.2.8},
  annote =	{Keywords: Type systems, subtyping, algorithmic type systems, distributive unions}
}

Keywords: Type systems, subtyping, algorithmic type systems, distributive unions
Collection: Special Issue of the 33rd European Conference on Object-Oriented Programming (ECOOP 2019)
Related Scholarly Article: https://dx.doi.org/10.4230/LIPIcs.ECOOP.2019.24
Issue Date: 2019
Date of publication: 12.07.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI