Generalising Techniques for Type Debugging
Bruce J. McAdam · 1999
Several authors have presented algorithms to help programmers understand the types in their programs and to help debug type errors. Each of these has supplied a different form of information to the programmer --- the types of unbound identifiers and suggestions of where in programs mistakes may lie are examples of such information. This paper presents a means of representing type information as graphs from which we can extract a range of different facts about the types in programs. The graph representation is presented, and we see how it can be used to simulate some of the schemes proposed by other authors. We conclude that these graphs generalise a number of previously disjoint pieces of work.