Calculating an Exceptional Machine

Hutton, Graham; Wright, Joel

Abstract

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.

Citation

Hutton, G., & Wright, J. (2005). Calculating an Exceptional Machine.

• Conference Name: Proceedings of the Fifth Symposium on Trends in Functional Programming
• Publication Date: Jan 1, 2005
• Deposit Date: Oct 26, 2005
• Publicly Available Date: Oct 9, 2007
• Peer Reviewed: Peer Reviewed
• Public URL: https://nottingham-repository.worktribe.com/output/1020436