Calculating an Exceptional Machine

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 th...

Full description

Bibliographic Details
Main Authors: Hutton, Graham, Wright, Joel
Format: Conference or Workshop Item
Published: 2005
Online Access:https://eprints.nottingham.ac.uk/235/
_version_ 1848790375804698624
author Hutton, Graham
Wright, Joel
author_facet Hutton, Graham
Wright, Joel
author_sort Hutton, Graham
building Nottingham Research Data Repository
collection Online Access
description 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.
first_indexed 2025-11-14T18:11:37Z
format Conference or Workshop Item
id nottingham-235
institution University of Nottingham Malaysia Campus
institution_category Local University
last_indexed 2025-11-14T18:11:37Z
publishDate 2005
recordtype eprints
repository_type Digital Repository
spelling nottingham-2352020-05-04T20:30:52Z https://eprints.nottingham.ac.uk/235/ Calculating an Exceptional Machine Hutton, Graham Wright, Joel 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. 2005 Conference or Workshop Item PeerReviewed Hutton, Graham and Wright, Joel (2005) Calculating an Exceptional Machine. In: Proceedings of the Fifth Symposium on Trends in Functional Programming, Munich, Germany.
spellingShingle Hutton, Graham
Wright, Joel
Calculating an Exceptional Machine
title Calculating an Exceptional Machine
title_full Calculating an Exceptional Machine
title_fullStr Calculating an Exceptional Machine
title_full_unstemmed Calculating an Exceptional Machine
title_short Calculating an Exceptional Machine
title_sort calculating an exceptional machine
url https://eprints.nottingham.ac.uk/235/