Creative Commons Attribution 4.0 International license
This artifact contains the Appendix of the paper, proofs of theorems declared in the paper, and a sample implementation of the type inference algorithm. The proof contains 3 main results: soundness, completness and decidability of the type-inference algorithm. Moreover, there are several proofs about the declarative system and also a soundness/completeness proof between stable subtyping and a syntax-directed specification.
@Article{zhao_et_al:DARTS.8.2.5,
author = {Zhao, Jinxu and Oliveira, Bruno C. d. S.},
title = {{Elementary Type Inference (Artifact)}},
pages = {5:1--5:2},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2022},
volume = {8},
number = {2},
editor = {Zhao, Jinxu and Oliveira, Bruno C. d. S.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.8.2.5},
URN = {urn:nbn:de:0030-drops-162036},
doi = {10.4230/DARTS.8.2.5},
annote = {Keywords: Type Inference}
}
39bef980178b43e6aba1012f048e6b89
(Get MD5 Sum)
The artifact has been evaluated as described in the ECOOP 2022 Call for Artifacts and the ACM Artifact Review and Badging Policy