Calculating an Exceptional Machine


Autoria(s): Hutton, Graham; Wright, Joel
Data(s)

2005

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.nottingham.ac.uk/235/1/machine.pdf

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

Idioma(s)

en

Relação

http://eprints.nottingham.ac.uk/235/

Tipo

Conference or Workshop Item

PeerReviewed