Decidable Subtyping of Existential Types for Julia

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Decidable Subtyping of Existential Types for Julia

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Decidable Subtyping of Existential Types for Julia

Popis výsledku anglicky

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.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2024

Kód důvěrnosti údajů

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

Název periodika

Proceedings of the ACM on Programming Languages (PACMPL)

ISSN

2475-1421

e-ISSN

2475-1421

Svazek periodika

8

Číslo periodika v rámci svazku

191

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

24

Strana od-do

1091-1114

Kód UT WoS článku

001264464100046

EID výsledku v databázi Scopus

2-s2.0-85196799002