Publication

Towards Improved GADT Reasoning in Scala

Aleksander Slawomir Boruch-Gruszecki, Lionel Emile Vincent Parreaux
2019
Conference Papers

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.

Official source

https://infoscience.epfl.ch/entities/publication/c6869154-fe0e-4f6b-8186-1bab5dc2a924

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Towards Improved GADT Reasoning in Scala

Chat with Graph Search

When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism

Type-Level Programming with Match Types

A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning