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

scala-2018-papers
10:20 - 11:50: Scala 2018 - Session 1: Scala Foundations at Frisco
Chair(s): Paolo G. GiarrussoEPFL, Switzerland
scala-2018-papers10:20 - 10:42
Talk
Olof KarlssonA3J Consulting, Sweden, Philipp HallerKTH, Sweden
DOI
scala-2018-papers10:42 - 11:05
Talk
Fengyun LiuEPFL, Switzerland, Aggelos BiboudisEPFL, Switzerland, Martin OderskyEPFL, Switzerland
DOI
scala-2018-papers11:05 - 11:27
Talk
Jaemin HongKAIST, South Korea, Jihyeok ParkKAIST, South Korea, Sukyoung RyuKAIST, South Korea
DOI
scala-2018-papers11:27 - 11:50
Talk
Ifaz KabirUniversity of Waterloo, Canada, Ondřej LhotákUniversity of Waterloo
DOI