Skip to main content

Research Repository

Advanced Search

Calculating an Exceptional Machine

Hutton, Graham; Wright, Joel

Authors

Joel Wright



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 http://eprints.nottingham.ac.uk/id/eprint/235
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf

Files


machine.pdf (79 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations