Calculating an Exceptional Machine

Graham Hutton and Joel Wright

To appear at Symposium on Trends in Functional Programming (TFP04), Munich, Germany, 25-26 November, 2004


Abstract

In previous work we showed how to verify a compiler for a small language with exceptions [MPC 2004]. In this article we show how to calculate, as opposed to verify, an abstract machine for this language. The key step is the use of Reynold's defunctionalization, an old program transformation technique that has recently been rejuvenated by the work of Danvy et al.


Server START Conference Manager
Update Time 11 Mar 2005 at 20:15:19
Maintainer hwloidl@tcs.informatik.uni-muenchen.de.
Start Conference Manager
Conference Systems