ECOOP 2019 (series) / Scala 2019 (series) / Tenth ACM SIGPLAN Scala Symposium /
Towards Improved GADT Reasoning in Scala
Generalized algebraic data types in Scala have been notoriously difficult to implement, in a way that is both sound and expressive enough to enable their typical use cases. Both major Scala compilers, Scalac and Dotty, are currently known to have soundness holes related to GADTs. The situation is particularly dire with covariant GADTs, where paradoxes due to Scala’s inheritance model have been exposed. This short paper is meant as an informal exploration of possible foundations for GADTs within Scala’s core constructs. Our aim is to formulate some important insights which could guide further implementation efforts towards a principled understanding of GADTs in Scala.
Wed 17 JulDisplayed time zone: Belfast change
Wed 17 Jul
Displayed time zone: Belfast change
10:30 - 12:10 | |||
10:30 30mResearch paper | Dependent Object Types with Implicit Functions Scala Alex Jeffery University of Sussex | ||
11:00 20mTalk | Symmetric Multiple Dispatch for Path Dependent Types Scala | ||
11:20 20mTalk | A universal encoding for functions in Scala based on structural types Scala Guillaume Martres EPFL, Switzerland | ||
11:40 30mShort-paper | Towards Improved GADT Reasoning in Scala Scala Lionel Parreaux EPFL, Aleksander Boruch-Gruszecki EPFL, Paolo G. Giarrusso TU Delft, The Netherlands |