Write a Blog >>
Fri 28 Sep 2018 11:05 - 11:27 at Frisco - Session 1: Scala Foundations Chair(s): Paolo G. Giarrusso

While the Scala type system provides expressive features like objects with type members, the lack of equality checking between path-dependent types prohibits some programming idioms. One such an example is abstract domain combinators in implementing static analyzers. In this paper, we propose to extend the Scala type system with path-equality, and formalize it as a DOT variant, π DOT, which supports records with type members and fields. We show that π DOT has the normalization property and prove its type soundness.

Fri 28 Sep

Displayed time zone: Guadalajara, Mexico City, Monterrey change

10:20 - 11:50
Session 1: Scala FoundationsScala 2018 at Frisco
Chair(s): Paolo G. Giarrusso EPFL, Switzerland
10:20
22m
Talk
Extending Scala with Records: Design, Implementation, and Evaluation
Scala 2018
Olof Karlsson A3J Consulting, Sweden, Philipp Haller KTH, Sweden
DOI
10:42
23m
Talk
Initialization Patterns in Dotty
Scala 2018
Fengyun Liu EPFL, Switzerland, Aggelos Biboudis EPFL, Switzerland, Martin Odersky EPFL, Switzerland
DOI
11:05
22m
Talk
Path Dependent Types with Path-Equality
Scala 2018
Jaemin Hong KAIST, South Korea, Jihyeok Park KAIST, South Korea, Sukyoung Ryu KAIST, South Korea
DOI
11:27
23m
Talk
κDOT: Scaling DOT with Mutation and Constructors
Scala 2018
Ifaz Kabir University of Waterloo, Canada, Ondřej Lhoták University of Waterloo
DOI