A note on elimination of simplest recursions

Authors:
Andrei P. Nemytykh
Affiliations:
Wuhan University, Wuhan, Hubei, China & Program Systems Institute RAS, Russia
Venue:
ASIA-PEPM '02 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation
Year:
2002

Citing 6
Cited 1

The concept of a supercompiler

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Deforestation: transforming programs to eliminate trees

Proceedings of the Second European Symposium on Programming
Arity raiser and use in program specialization

Proceedings of the third European symposium on programming on ESOP '90
Essence of generalized partial computation

Theoretical Computer Science - Images of programming dedicated to the memory of Andrei P. Ershov
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)

A note on specialization of interpreters

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automatic program transformation, such as specialization, often introduces intermediate recursions that compute partial functions on parameters that are directly defined by simple recursive definitions. Replacing these recursive definitions by one-step definitions not only simplifies the residual program, but also allows more useful information to be propagated to remaining parts of the program, for continuing specialization.We give an easily recognized characterization of a class of recursive definitions, called syntactical monomials, that can be transformed to one-step definitions. We show our transformation is meaningful for specialization of interpreters and self-application of specializers.