Previous methods have generally identified the location of a type
error as a particular program point or the program subtree rooted at
that point. In the paper "Type Error Slicing in Implicitly Typed
Higher-Order Languages" by two of us (Christian Haack and Joe Wells), we present a
new approach that treats the location of a type error as a minimal set
of program points which are necessary for the type error and presents
this "location" as a slice of the program. Connected to this paper,
we have implemented type error slicing for a subset of core Standard
ML.
This is nice. When I show these kinds of errors, though, I prefer to show the mismatches by drawing arrows between the the relevant program points. This is perhaps a bit harder to do on the web, but will make the demo more compelling...
Posted to Software-Eng by Ehud Lamm on 11/27/02; 4:39:48 AM
|
|