Type error slicing in implicitly typed higher-order languages

Christian Haack, J. B. Wells

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)

40 Citations (Scopus)

Abstract

Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that identifies the location of a type error as a set of program points (a slice) all of which are necessary for the type error. We describe algorithms for finding minimal type error slices for implicitly typed higher-order languages like Standard ML. © Springer-Verlag Berlin Heidelberg 2003.

Original languageEnglish
Title of host publicationProgramming Languages and Systems
Subtitle of host publication12th European Symposium on Programming, ESOP 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings
Pages284-301
Number of pages18
Volume2618
ISBN (Electronic)978-3-540-36575-4
DOIs
Publication statusPublished - 2003
Event12th European Symposium on Programming - Warsaw, Poland
Duration: 7 Apr 200311 Apr 2003

Publication series

NameLecture Notes in Computer Science
Volume2618
ISSN (Print)0302-9743

Conference

Conference12th European Symposium on Programming
Abbreviated titleESOP 2003
CountryPoland
CityWarsaw
Period7/04/0311/04/03

Cite this

Haack, C., & Wells, J. B. (2003). Type error slicing in implicitly typed higher-order languages. In Programming Languages and Systems: 12th European Symposium on Programming, ESOP 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings (Vol. 2618, pp. 284-301). (Lecture Notes in Computer Science; Vol. 2618). https://doi.org/10.1007/3-540-36575-3_20