Christian Haack and J. B. Wells
Type error slicing in implicitly typed
higher-order languages
Sci. Comput. Programming, 50:189-224, 2004
Special issue of best papers from ESOP '03
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 identify the criteria of
completeness and minimality for type
error slices. We discuss the advantages of complete
and minimal type error slices over previous methods
of presenting type errors. We present and prove the
correctness of algorithms for finding complete and
minimal type error slices for implicitly typed
higher-order languages like Standard ML.
[ bib |
.pdf ]
Back
This file has been generated by
bibtex2html 1.43