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...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2005
|
| Online Access: | https://eprints.nottingham.ac.uk/235/ |