Type Directives and Type Graphs in Elm

Falco Peijnenburg, J. Hage, Alejandro Serrano

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationProceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages
Subtitle of host publicationIFL 2016
PublisherAssociation for Computing Machinery
ISBN (Print)9781450347679
Publication statusPublished - Aug 2016


Dive into the research topics of 'Type Directives and Type Graphs in Elm'. Together they form a unique fingerprint.

Cite this