A case for DOT: theoretical foundations for objects with pattern matching and GADT-style reasoning-Reference-Cited by-同舟云学术

A case for DOT: theoretical foundations for objects with pattern matching and GADT-style reasoning

Published:2022-10-31 Issue:OOPSLA2 Volume:6 Page:1526-1555
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Boruch-Gruszecki Aleksander¹^ORCID,Waśko Radosław²^ORCID,Xu Yichen³^ORCID,Parreaux Lionel⁴^ORCID

Affiliation:

1. EPFL, Switzerland

2. University of Warsaw, Poland

3. Beijing University of Posts and Telecommunications, China

4. Hong Kong University of Science and Technology, China

Abstract

Many programming languages in the OO tradition now support pattern matching in some form. Historical examples include Scala and Ceylon, with the more recent additions of Java, Kotlin, TypeScript, and Flow. But pattern matching on generic class hierarchies currently results in puzzling type errors in most of these languages. Yet this combination of features occurs naturally in many scenarios, such as when manipulating typed ASTs. To support it properly, compilers needs to implement a form of subtyping reconstruction: the ability to reconstruct subtyping information uncovered at runtime during pattern matching. We introduce cDOT, a new calculus in the family of Dependent Object Types (DOT) intended to serve as a formal foundation for subtyping reconstruction. Being descended from pDOT, itself a formal foundation for Scala, cDOT can be used to encode advanced object-oriented features such as generic inheritance, type constructor variance, F-bounded polymorphism, and first-class recursive modules. We demonstrate that subtyping reconstruction subsumes GADTs by encoding λ 2, G µ , a classical constraint-based GADT calculus, into cDOT.

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3563342

Reference45 articles.

1. Nada Amin , Samuel Grütter , Martin Odersky , Tiark Rompf , and Sandro Stucki . 2016. The Essence of Dependent Object Types . In A List of Successes That Can Change the World . Springer , 249–272. Nada Amin, Samuel Grütter, Martin Odersky, Tiark Rompf, and Sandro Stucki. 2016. The Essence of Dependent Object Types. In A List of Successes That Can Change the World. Springer, 249–272.

2. Foundations of path-dependent types

3. Aleksander Boruch-Gruszecki. 2017. Verifying the totality of pattern matching in Scala. Master’s thesis. Wrocł aw University of Science and Technology. Aleksander Boruch-Gruszecki. 2017. Verifying the totality of pattern matching in Scala. Master’s thesis. Wrocł aw University of Science and Technology.

4. Aleksander Boruch-Gruszecki , Radosł aw Waśko , Yichen Xu, and Lionel Parreaux. 2022 . A Case for DOT: Theoretical Foundations for Objects With Pattern Matching and GADT-style Reasoning . https://doi.org/10.48550/arXiv.2209.07427 arxiv:2209.07427. 10.48550/arXiv.2209.07427 Aleksander Boruch-Gruszecki, Radosł aw Waśko, Yichen Xu, and Lionel Parreaux. 2022. A Case for DOT: Theoretical Foundations for Objects With Pattern Matching and GADT-style Reasoning. https://doi.org/10.48550/arXiv.2209.07427 arxiv:2209.07427.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism;Proceedings of the ACM on Programming Languages;2024-01-05