scientific article; zbMATH DE number 3890701
From MaRDI portal
Publication:3347260
[For the entire collection see Zbl 0552.00012.] In this paper, we construct a theory for an automatic program transformation with tupling technique. We introduce a purely applicative programming language and formalize a problem to find a tuple for transformation of a recursive program written in the language. We discuss the transformation scheme with the tupling given as the solution to the problem and show that the execution efficiency will be improved by the new scheme. Under a certain constraint, we describe the method to find a tuple for a given program.
Recommendations
Cited in
(8)- Description and improvement of iterative program transformations
- A transformation method for dynamic-sized tabulation
- Analyzing Array Manipulating Programs by Program Transformation
- The promotion and accumulation strategies in transformational programming
- Towards a modular program derivation via fusion and tupling
- scientific article; zbMATH DE number 2102053 (Why is no real title available?)
- From sequential programs to multi-tier applications by program transformation
- Tupling calculation eliminates multiple data traversals
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347260)