Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2998392.2998400 | SCALA@SPLASH |
Keywords | Field | DocType |
type constructor polymorphism,higher-kinded types,higher-order genericity,Scala,dotty,DOT,dependent object types | Lambda calculus,Programming language,Scala,Computer science,Object type,Usability,Compiler,Theoretical computer science,Haskell,Expressive power | Conference |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Odersky | 1 | 2261 | 170.39 |
| Guillaume Martres | 2 | 0 | 1.01 |
| Dmitry Petrashko | 3 | 9 | 1.56 |