Type error slicing in implicitly typed higher-order languages

Christian Haack, J.B. Wells
2004 Science of Computer Programming  
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.
doi:10.1016/j.scico.2004.01.004 fatcat:jtyzj3bmqbaa3ns425gmsv6s6q