University of Limerick
Browse
2010-Mendel-Gleason-Supercompilation.pdf (414.26 kB)

Supercompilation and normalisation by evaluation

Download (414.26 kB)
conference contribution
posted on 2011-01-26, 16:18 authored by Gavin E. Mendel-Gleason, Geoff W. Hamilton
It has been long recognised that partial evaluation is related to proof normalisation. Normalisation by evaluation, which has been presented for theories with simple types, has made this correspondance formal. Recently Andreas Abel formalised an algorithm for normalisation by evaluation for System F. This is an important step towards the use of such techniques on practical functional programming languages such as Haskell which can reasonably be embedded in relatives of System F?. Supercompilation is a program transformation technique which performs a superset of the simplications performed by partial evaluation. The focus of this paper is to formalise the relationship between supercompilation and normalisation by evaluation.

History

Publication

Proceedings of Meta2010 Second International Workshop on Metacomputation in Russia;pp 128-145

Publisher

Meta2010

Note

peer-reviewed

Other Funding information

SFI

Language

English

Usage metrics

    University of Limerick

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC