Type Directives and Type Graphs in Elm

Falco Peijnenburg, J. Hage, A. Serrano Mena

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    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.
    Original languageEnglish
    Title of host publicationProceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages, IFL 2016
    Subtitle of host publicationLeuven, Belgium, August 31 - September 2, 2016
    Place of PublicationNew York
    PublisherAssociation for Computing Machinery
    Number of pages12
    ISBN (Print)978-1-4503-4767-9
    DOIs
    Publication statusPublished - 2016

    Fingerprint

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

    Cite this