dotty is a new, experimental Scala compiler based on DOT, the calculus of Dependent Object Types. Higher-kinded types are a natural extension of first-order lambda calculus, and have been a core construct of Haskell and Scala. As long as such types are just partial applications of generic classes, they can be given a meaning in DOT relatively straightforwardly. But general lambdas on the type level require extensions of the DOT calculus to be expressible. This paper is an experience report where we describe and discuss four implementation strategies that we have tried out in the last three years. Each strategy was fully implemented in the dotty compiler. We discuss the usability and expressive power of each scheme, and give some indications about the amount of implementation difficulties encountered.
Sun 30 OctDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
10:30 - 12:10 | |||
10:30 25mTalk | Implementing Higher-Kinded Types in Dotty Scala Martin Odersky EPFL, Switzerland, Guillaume Martres EPFL, Switzerland, Dmitry Petrashko EPFL, Switzerland DOI Pre-print Media Attached | ||
10:55 25mTalk | Semantics-Driven Interoperability between Scala.js and JavaScript Scala Sébastien Doeraene EPFL, Switzerland, Tobias Schlatter EPFL, Switzerland, Nicolas Stucki EPFL, Switzerland DOI Pre-print | ||
11:20 25mTalk | A Generic Algorithm for Checking Exhaustivity of Pattern Matching (Short Paper) Scala Fengyun Liu EPFL, Switzerland DOI Media Attached | ||
11:45 25mTalk | Scaps: Type-Directed API Search for Scala Scala Lukas Wegmann 1plusX, Switzerland, Farhad Mehta University of Applied Sciences Rapperswil, Switzerland, Peter Sommerlad University of Applied Sciences Rapperswil, Switzerland, Mirko Stocker University of Applied Sciences Rapperswil, Switzerland DOI File Attached |