Title: Type Error Slicing in Implicitly Typed, Higher-Order Languages

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 type error slice). On the
one hand, type error slices contain enough program points to permit an
independent explanation of a type error (``completeness''). On the
other hand, they contain only program points that are necessary for
such an explanation (``minimality''). We describe algorithms for
finding type error slices for implicitly typed higher-order languages
like Standard ML.