DARTS.5.2.8.pdf
- Filesize: 265 kB
- 2 pages
Document
On Julia’s Efficient Algorithm for Subtyping Union Types and Covariant Tuples (Artifact)
Authors
-
Part of:
Issue:
Special Issue of the 33rd European Conference on Object-Oriented Programming (ECOOP 2019)
Volume: DARTS, Volume 5 (ECOOP 2019)
Conference: European Conference on Object-Oriented Programming (ECOOP)
Journal: Dagstuhl Artifacts Series (DARTS) - License:
Creative Commons Attribution 3.0 Germany license
- Publication Date: 2019-07-12
Artifact Description
Document Identifiers
Cite As Get BibTex
Benjamin Chung, Francesco Zappa Nardelli, and Jan Vitek. On Julia’s Efficient Algorithm for Subtyping Union Types and Covariant Tuples (Artifact). In Special Issue of the 33rd European Conference on Object-Oriented Programming (ECOOP 2019). Dagstuhl Artifacts Series (DARTS), Volume 5, Issue 2, pp. 8:1-8:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/DARTS.5.2.8
Artifact
DARTS-5-2-8-artifact-4d0356d94cd8d21f42e6b73de886f871.zip
(Filesize: 0.71 MB)
MD5 Sum:
4d0356d94cd8d21f42e6b73de886f871
(Get MD5 Sum)
Abstract
This is the artifact for the pearl paper "On Julia’s efficient algorithm for subtyping union types and covariant tuples."
Subject Classification
ACM Subject Classification
- Theory of computation → Type theory
- Software and its engineering → General programming languages
Keywords
- Type systems
- subtyping
- algorithmic type systems
- distributive unions
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads