Type error slicing in implicitly typed higher-order languages

Christian Haack, J. B. Wells

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

46 Citations (Scopus)


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
Number of pages18
ISBN (Electronic)978-3-540-36575-4
Publication statusPublished - 2003
Event12th European Symposium on Programming - Warsaw, Poland
Duration: 7 Apr 200311 Apr 2003

Publication series

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


Conference12th European Symposium on Programming
Abbreviated titleESOP 2003


Dive into the research topics of 'Type error slicing in implicitly typed higher-order languages'. Together they form a unique fingerprint.

Cite this