Type Directives and Type Graphs in Elm
Publication date
2016
Authors
Peijnenburg, Falco
Hage, J.
Serrano Mena, A.
Editors
Advisors
Supervisors
Document Type
Part of book
Metadata
Show full item recordCollections
License
taverne
Abstract
We introduce type graphs into Elm in order to improve type error messages for infinite types, and integrate type qualifiers (for type classes a la Haskell) and Elm's row polymorphism into type graphs. We also discuss how specialized type rules and siblings can be used to achieve domain-specific type error diagnosis in the context of Elm.
Keywords
Taverne
Citation
Peijnenburg, F, Hage, J & Serrano Mena, A 2016, Type Directives and Type Graphs in Elm. in Proceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages, IFL 2016 : Leuven, Belgium, August 31 - September 2, 2016., 2, Association for Computing Machinery, New York. https://doi.org/10.1145/3064899.3064907