Towards improved GADT reasoning in Scala

Conference paper (2019)

Authors

Lionel Parreaux Swiss Federal Institute of Technology
Aleksander Boruch-Gruszecki Swiss Federal Institute of Technology
P.G. Giarrusso Programming Languages - EEMCS
Research Group
Programming Languages (EEMCS) (TU Delft)
More Info
expand_more

Published Date

17-07-2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Programming Languages

Abstract

Generalized algebraic data types (GADT) have been notoriously difficult to implement correctly in Scala. Both major Scala compilers, Scalac and Dotty, are currently known to have type soundness holes related to them. In particular, covariant GADTs have exposed paradoxes due to Scala's inheritance model. We informally explore foundations for GADTs within Scala's core type system, to guide a principled understanding and implementation of GADTs in Scala.

Files

P12_parreaux.pdf
(pdf | 0.565 Mb)

Download not available