Calculating an Exceptional Machine

Hutton, Graham and Wright, Joel (2005) Calculating an Exceptional Machine. In: Proceedings of the Fifth Symposium on Trends in Functional Programming, Munich, Germany.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


In previous work we showed how to verify a compiler for a small language with exceptions. 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.

Item Type:Conference or Workshop Item (Paper)
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:235
Deposited By:Hutton, Graham
Deposited On:26 Oct 2005
Last Modified:09 Oct 2007 16:50

Repository Staff Only: item control page