KIAM Main page Web Library  •  Publication Search  Русский 

№ 26, Moscow, 2013
Authors: Grechanik S.A.
Supercompilation by hypergraph transformation
This paper presents a reformulation of the notion of multi-result supercompilation in terms of graph transformations. For this purpose we use a hypergraph-based representation of the program being transformed. The presented approach bridges the gap between supercompilation and equality saturation. We also show how higher-level supercompilation naturally arises in this setting.
supercompilation equality saturation program transformation
Publication language: english, pages: 24
Research direction:
Programming, parallel computing, multimedia
Source text: