This paper gives a gentle introduction to Turchin’s supercompilation and its applications in metacomputation with an emphasis on recent developments. First, a complete supercompiler, including positive driving and generalization, is defined for a functional language and illustrated with examples. Then a taxonomy of related transformers is given and compared to the supercompiler. Finally, we put supercompilation into the larger perspective of metacomputation and consider three metacomputation tasks: specialization, composition, and inversion.
CITATION STYLE
Glück, R., & Sørensen, M. H. (1996). A roadmap to metacomputation by supercompilation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1110, pp. 137–160). Springer Verlag. https://doi.org/10.1007/3-540-61580-6_8
Mendeley helps you to discover research relevant for your work.