Type Directives and Type Graphs in Elm

Falco Peijnenburg; J. Hage; Alejandro Serrano

doi:10.1145/3064899.3064907

Type Directives and Type Graphs in Elm

Falco Peijnenburg, J. Hage, Alejandro Serrano

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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 language	English
Title of host publication	Proceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages
Subtitle of host publication	IFL 2016
Publisher	Association for Computing Machinery
ISBN (Print)	9781450347679
DOIs	https://doi.org/10.1145/3064899.3064907
Publication status	Published - Aug 2016

Access to Document

10.1145/3064899.3064907

Cite this

@inproceedings{92aafe9ff07b469390264477b265d584,

title = "Type Directives and Type Graphs in Elm",

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.",

author = "Falco Peijnenburg and J. Hage and Alejandro Serrano",

year = "2016",

month = aug,

doi = "10.1145/3064899.3064907",

language = "English",

isbn = "9781450347679",

booktitle = "Proceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages",

publisher = "Association for Computing Machinery",

address = "United States",

}

TY - GEN

T1 - Type Directives and Type Graphs in Elm

AU - Peijnenburg, Falco

AU - Hage, J.

AU - Serrano, Alejandro

PY - 2016/8

Y1 - 2016/8

N2 - 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.

AB - 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.

U2 - 10.1145/3064899.3064907

DO - 10.1145/3064899.3064907

M3 - Conference contribution

SN - 9781450347679

BT - Proceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages

PB - Association for Computing Machinery

ER -

Type Directives and Type Graphs in Elm

Abstract

Access to Document

Fingerprint

Cite this