Member of the Formal Methods and Logics of Computation group in Udine.
Principal interests:
Type Theory-based Formal Methods
(the Coq proof assistant):
exact real numbers,
object-based calculi,
computational metamodels,
The POPLmark Challenge.
Proof techniques for mobile, distributed processes.
Reversible computation, involutions, and types.
Type systems for functional, object-based calculi.