Contributions offered by Francois Pessaux for topics 

G (types and type inference in programming)

We'd like to present a program analysis to estimate uncaught
exceptions in ML programs.  This analysis is based on unification
(type inference) in a non-standard 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 both efficient and precise; in particular,
arguments carried by exceptions are accurately handled.

--------------------------------------------------------------
Result of feedback form submitted by
Francois (francois.pessaux@inria.fr) on Friday, July 17, 1998 at 15:55:3