Thumbnail Image
Publication

Supercompilation and normalisation by evaluation

Date
2010
Abstract
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.
Supervisor
Description
peer-reviewed
Publisher
META
Citation
Proceedings of Meta2010 Second International Workshop on Metacomputation in Russia;pp 128-145
Collections
Lero - The Science Foundation Ireland Research Centre for Software
Show all metadata
Files
Thumbnail Image
2010-Mendel-Gleason-Supercompilation.pdf
Adobe PDF, 414.26 KB
Keywords
normalisation, supercompilation
ULRR Identifiers
https://researchrepository.ul.ie/handle/10344/667
 https://doi.org/10.34961/5391
Funding code
Funding Information
Science Foundation Ireland (SFI)
Sustainable Development Goals
External Link
Type
Meetings and Proceedings
Rights
https://creativecommons.org/licenses/by-nc-sa/1.0/
License