Decidable Subtyping of Existential Types for Julia

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00387943" target="_blank" >RIV/68407700:21240/24:00387943 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1145/3656421" target="_blank" >https://doi.org/10.1145/3656421</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/3656421" target="_blank" >10.1145/3656421</a>

Result language
angličtina
Original language name
Decidable Subtyping of Existential Types for Julia
Original language description
Julia is a modern scientific-computing language that relies on multiple dispatch to implement generic libraries. While the language does not have a static type system, method declarations are decorated with expressive type annotations to determine when they are applicable. To find applicable methods, the implementation uses subtyping at run-time. We show that Julia's subtyping is undecidable, and we propose a restriction on types to recover decidability by stratifying types into method signatures over value types-where the former can freely use bounded existential types but the latter are restricted to use-site variance. A corpus analysis suggests that nearly all Julia programs written in practice already conform to this restriction.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)