Christian Haack and J. B. Wells
Type error slicing in implicitly typed
higher-order languages
In Programming Languages & Systems, 12th European Symp. Programming, volume 2618 of Lecture Notes in Computer Science, pages
284-301 Springer, 2003
Superseded by [46]
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.
[ bib |
.pdf ]
Back
This file has been generated by
bibtex2html 1.43