Answers are grounded in this paper and cite their sources.
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 escaping exceptions (a la effect systems) and the flow of result values (a la control-flow analyses). The resulting analysis is efficient and precise; in particular, arguments carried by exceptions are accurately handled.
No takes yet. Share an insight, caveat, or question.
Leroy et al. (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: