Article

Free access

Towards an automated tupling strategy

Author:

Wei-Ngan ChinAuthors Info & Claims

PEPM '93: Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Pages 119 - 132

https://doi.org/10.1145/154630.154643

Published: 01 August 1993 Publication History

PDF eReader

Abstract

The tupling transformation strategy can be used to merge loops together by combining recursive calls and also to eliminate redundant calls for a class of programs. The clever (and difficult) step of this transformation strategy is to find an appropriate tuple of calls, called the eureka tuple, which would allow each set of calls to be computed recursively from its previous set. In many cases, this transformation can produce super-linear speedup.

In this paper, we present an analysis method which could find eureka tuples for a wide range of functional programs. Our work extends that of a number of past techniques which have used dependency graphs of function calls for analysing redundancy patterns. Our main contribution is the use of appropriate call orderings based on recursion parameters to systematically search for eureka tuples in dependency graphs. They allow us to construct sequences of tuples, called the continuous sequences of tuples, whereby the existence of a matched pair of tuples in the sequence corresponds to a suitable eureka tuple.

An extension of the basic analysis method which uses trees, instead of sequences, of tuples will also be presented. The basic and extended analysis methods will be shown to be applicable to a wide range of programs. They can be guaranteed to terminate by either bounding the search or by applying suitable restrictions on the class of applicable programs. The latter approach yields a safe automated procedure for tupling transformation.

Cited By

View all

MATSUDA KWANG M(2024) Sparcl : A language for partially invertible computation Journal of Functional Programming10.1017/S095679682300012634Online publication date: 26-Jan-2024
https://doi.org/10.1017/S0956796823000126
Faisal Al Ameen MKobayashi NSato R(2024)Asynchronous unfold/fold transformation for fixpoint logicScience of Computer Programming10.1016/j.scico.2023.103014231:COnline publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1016/j.scico.2023.103014
Matsuda KFrohlich SWang MWu N(2023)Embedding by UnembeddingProceedings of the ACM on Programming Languages10.1145/36078307:ICFP(1-47)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607830
Show More Cited By

Index Terms

Towards an automated tupling strategy

Recommendations

Tupling calculation eliminates multiple data traversals

Tupling is a well-known transformation tactic to obtain new efficient recursive functions by grouping some recursive functions into a tuple. It may be applied to eliminate multiple traversals over the common data structure. The major difficulty in ...
Tupling calculation eliminates multiple data traversals
ICFP '97: Proceedings of the second ACM SIGPLAN international conference on Functional programming

Tupling is a well-known transformation tactic to obtain new efficient recursive functions by grouping some recursive functions into a tuple. It may be applied to eliminate multiple traversals over the common data structure. The major difficulty in ...
Redundant Call Elimination via Tupling
Program Transformation: Theoretical Foundations and Basic Techniques. Part 2

Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the tupling transformation in achieving this optimisation over a first-order ...

Comments

Information & Contributors

Information

Published In

PEPM '93: Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

August 1993

215 pages

ISBN:0897915941

DOI:10.1145/154630

Chairman:
David Schmidt

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PEPM93

Sponsor:

SIGPLAN

PEPM93: ACM Symposium on Partial Evaluation

June 14 - 16, 1993

Copenhagen, Denmark

Acceptance Rates

Overall Acceptance Rate 66 of 120 submissions, 55%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

59
Total Citations
View Citations
220
Total Downloads

Downloads (Last 12 months)67
Downloads (Last 6 weeks)4

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

MATSUDA KWANG M(2024) Sparcl : A language for partially invertible computation Journal of Functional Programming10.1017/S095679682300012634Online publication date: 26-Jan-2024
https://doi.org/10.1017/S0956796823000126
Faisal Al Ameen MKobayashi NSato R(2024)Asynchronous unfold/fold transformation for fixpoint logicScience of Computer Programming10.1016/j.scico.2023.103014231:COnline publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1016/j.scico.2023.103014
Matsuda KFrohlich SWang MWu N(2023)Embedding by UnembeddingProceedings of the ACM on Programming Languages10.1145/36078307:ICFP(1-47)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607830
Ye QDelaware B(2023)Taype: A Policy-Agnostic Language for Oblivious ComputationProceedings of the ACM on Programming Languages10.1145/35912617:PLDI(1001-1025)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591261
Verbitskaia EBerezun DBoulytchev D(2021)An Empirical Study of Partial Deduction for miniKanrenElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.341.5341(73-94)Online publication date: 6-Sep-2021
https://doi.org/10.4204/EPTCS.341.5
Matsuda KWang M(2020)Sparcl: a language for partially-invertible computationProceedings of the ACM on Programming Languages10.1145/34090004:ICFP(1-31)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3409000
Niculescu VLoulergue F(2019)Transforming powerlist-based divide-and-conquer programs for an improved execution modelThe Journal of Supercomputing10.1007/s11227-019-02820-xOnline publication date: 25-Mar-2019
https://doi.org/10.1007/s11227-019-02820-x
Nishida NVidal G(2019)Characterizing Compatible View Updates in Syntactic BidirectionalizationReversible Computation10.1007/978-3-030-21500-2_5(67-83)Online publication date: 23-May-2019
https://doi.org/10.1007/978-3-030-21500-2_5
Asada KSato RKobayashi NAsai KSagonas K(2015)Verifying Relational Properties of Functional Programs by First-Order RefinementProceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation10.1145/2678015.2682546(61-72)Online publication date: 13-Jan-2015
https://dl.acm.org/doi/10.1145/2678015.2682546
CHIBA YAOTO TTOYAMA Y(2010)Program Transformation Templates for Tupling Based on Term RewritingIEICE Transactions on Information and Systems10.1587/transinf.E93.D.963E93-D:5(963-973)Online publication date: 2010
https://doi.org/10.1587/transinf.E93.D.963
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Tupling calculation eliminates multiple data traversals

Tupling calculation eliminates multiple data traversals

Redundant Call Elimination via Tupling

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

Cited By

Index Terms

Recommendations

Tupling calculation eliminates multiple data traversals

Tupling calculation eliminates multiple data traversals

Redundant Call Elimination via Tupling

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations