Type-based analysis of uncaught exceptions

This article presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a ,nonstandard type system, using rows to approximate both the flow of escapi ng exceptions (a la effect systems) and the flow of result values (a la con trol-flow analyses). The resulting analysis is efficient and precise; in pa rticular, arguments carried by exceptions are accurately handled.