國立虎尾科技大學 |

Decidable Subtyping of Existential Types for the Julia Language.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Decidable Subtyping of Existential Types for the Julia Language./
作者:	Belyakova, Yulia.
面頁冊數:	1 online resource (106 pages)
附註:	Source: Dissertations Abstracts International, Volume: 85-02, Section: B.
Contained By:	Dissertations Abstracts International85-02B.
標題:	Computer engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9798380126632

Decidable Subtyping of Existential Types for the Julia Language.
Belyakova, Yulia.

Decidable Subtyping of Existential Types for the Julia Language. - 1 online resource (106 pages)

Source: Dissertations Abstracts International, Volume: 85-02, Section: B.

Thesis (Ph.D.)--Northeastern University, 2023.

Includes bibliographical references

Julia is a dynamic, high-performance programming language for scientific computing. To encourage a high level of code reuse and extensibility, Julia is designed around symmetric multiple dynamic dispatch, which allows functions to have multiple implementations tailored to different argument types. To resolve multiple dispatch, Julia relies on a subtype relation over a complex language of run-time types and type annotations, which include set-theoretic unions, distributive tuples, parametric invariant types, and impredicative existential types. Notably, subtyping in Julia is undecidable, which manifests with a run-time stack-overflow error when program execution encounters a subtyping query that causes the subtype checker to loop.In this dissertation, I propose a decidable subtype relation for a restricted language of Julia types where existential types inside invariant constructors are limited to ones expressible with use-site variance. To estimate migration effort that would be required for switching to the restricted type language, I analyze type annotations in the corpus of 9K registered Julia packages. Out of 2M statically identifiable type annotations in the corpus, 99.99% satisfy the restriction, making it a viable candidate for evolving Julia towards decidable subtyping.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798380126632Subjects--Topical Terms:

569006
Computer engineering.
Subjects--Index Terms:

DecidabilityIndex Terms--Genre/Form:

554714
Electronic books.

Decidable Subtyping of Existential Types for the Julia Language.
LDR:02591ntm a22003737 4500 001 1143855
005 20240517105011.5
006 m o d
007 cr mn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798380126632
035 $a (MiAaPQ)AAI30636584
035 $a AAI30636584
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Belyakova, Yulia. $3 1468660
245 1 0 $a Decidable Subtyping of Existential Types for the Julia Language.
264 0 $c 2023
300 $a 1 online resource (106 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 85-02, Section: B.
500 $a Advisor: Vitek, Jan.
502 $a Thesis (Ph.D.)--Northeastern University, 2023.
504 $a Includes bibliographical references
520 $a Julia is a dynamic, high-performance programming language for scientific computing. To encourage a high level of code reuse and extensibility, Julia is designed around symmetric multiple dynamic dispatch, which allows functions to have multiple implementations tailored to different argument types. To resolve multiple dispatch, Julia relies on a subtype relation over a complex language of run-time types and type annotations, which include set-theoretic unions, distributive tuples, parametric invariant types, and impredicative existential types. Notably, subtyping in Julia is undecidable, which manifests with a run-time stack-overflow error when program execution encounters a subtyping query that causes the subtype checker to loop.In this dissertation, I propose a decidable subtype relation for a restricted language of Julia types where existential types inside invariant constructors are limited to ones expressible with use-site variance. To estimate migration effort that would be required for switching to the restricted type language, I analyze type annotations in the corpus of 9K registered Julia packages. Out of 2M statically identifiable type annotations in the corpus, 99.99% satisfy the restriction, making it a viable candidate for evolving Julia towards decidable subtyping.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer engineering. $3 569006
650 4 $a Computer science. $3 573171
653 $a Decidability
653 $a Julia language
653 $a Multiple dispatch
653 $a Subtyping
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0464
710 2 $a Northeastern University. $b Computer Science. $3 1464678
710 2 $a ProQuest Information and Learning Co. $3 1178819
773 0 $t Dissertations Abstracts International $g 85-02B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30636584 $z click for full text (PQDT)