article

Using circular programs to eliminate multiple traversals of data

Author:

R. S. BirdAuthors Info & Claims

Acta Informatica, Volume 21, Issue 3

Pages 239 - 250

https://doi.org/10.1007/BF00264249

Published: 01 October 1984 Publication History

Abstract

This paper describes a technique for transforming functional programs that repeatedly traverse a data structure into more efficient alternatives that do not. The transformation makes essential use of lazy evaluation and local recursion (such as provided by letrec, or its equivalent) to build a circular program that, on one pass over the structure, determines the effects of the individual traversals and then combines them.

References

[1]

Bird, R.S.: Programs and Machines -- An Introduction to the Theory of Computation. London: John Wiley 1976

Google Scholar

[2]

Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. J. ACM 24, 44---67 (1977)

Digital Library

Google Scholar

[3]

Burstall, R.M., Macqueen, D.B., Sannella, D.T.: HOPE: an experimental applicative language. Int Res Report. Dept Computer Science, University of Edinburgh 1980

Google Scholar

[4]

Feather, M.: A system for assisting program transformation. ACM Trans Progr. Lang. Syst. 4, 1---20 (1982)

Digital Library

Google Scholar

[5]

Henderson, P.: Functional Programming: Application and Implementation. Englewood Cliffs: Prentice-Hall 1980

Crossref

Google Scholar

[6]

Hughes, R.J.M.: The Design and Implementation of Programming Languages. D. Phil. Thesis. Oxford University 1983

Google Scholar

[7]

Kott, L.: About a transformation system: a theoretical study. Proc. Third Symp. Progr. Paris, 1971

Google Scholar

[8]

Turner, D.: Recursion equations as a programming language. In: Functional Programming and its Applications (Darlington, J., Henderson, P., Turner, D. (eds.). Cambridge: University Press, 1982

Google Scholar

[9]

Wadler, P.: (personal communication)

Google Scholar

[10]

Wadler, P.: Listlessness is better than laziness. Ph. D. Thesis, Carnegie-Mellon University, 1984

Crossref

Google Scholar

Cited By

View all

Kirkeby MSantos BFernandes JPardo AHong JPark J(2024)Compiling Haskell for Energy Efficiency: Empirical Analysis of Individual TransformationsProceedings of the 39th ACM/SIGAPP Symposium on Applied Computing10.1145/3605098.3635915(1104-1113)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3605098.3635915
Gibbons JKidney DSchrijvers TWu NSperber MHutton G(2023)Phases in Software ArchitectureProceedings of the 1st ACM SIGPLAN International Workshop on Functional Software Architecture10.1145/3609025.3609479(29-33)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3609025.3609479
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
Show More Cited By

Recommendations

Tools and libraries to model and manipulate circular programs
PEPM '07: Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

This paper presents techniques to model circular lazy programs in a strict, purely functional setting. Circular lazy programs model any algorithm based on multiple traversals over a recursive data structure as a single traversal function. Such elegant ...
Using Circular Programs to Deforest in Accumulating Parameters

This paper presents a functional program transformation that removes intermediate data structures in compositions of two members of a class of recursive functions with accumulating parameters. To avoid multiple traversals of the input data structure, ...
Design, Implementation and Calculation of Circular Programs: Multiple Traversal Algorithms in a Lazy Functional Setting

Comments

Information & Contributors

Information

Published In

Acta Informatica Volume 21, Issue 3

October 1984

89 pages

ISSN:0001-5903

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 October 1984

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

69
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kirkeby MSantos BFernandes JPardo AHong JPark J(2024)Compiling Haskell for Energy Efficiency: Empirical Analysis of Individual TransformationsProceedings of the 39th ACM/SIGAPP Symposium on Applied Computing10.1145/3605098.3635915(1104-1113)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3605098.3635915
Gibbons JKidney DSchrijvers TWu NSperber MHutton G(2023)Phases in Software ArchitectureProceedings of the 1st ACM SIGPLAN International Workshop on Functional Software Architecture10.1145/3609025.3609479(29-33)Online publication date: 30-Aug-2023
https://dl.acm.org/doi/10.1145/3609025.3609479
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
Macedo JRodrigues EViera MSaraiva JBrady EPalsberg J(2023)Efficient Embedding of Strategic Attribute Grammars via MemoizationProceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation10.1145/3571786.3573019(41-54)Online publication date: 15-Jan-2023
https://dl.acm.org/doi/10.1145/3571786.3573019
Danvy O(2022)The Tortoise and the Hare Algorithm for Finite Lists, CompositionallyACM Transactions on Programming Languages and Systems10.1145/356461945:1(1-35)Online publication date: 26-Sep-2022
https://dl.acm.org/doi/10.1145/3564619
Nishimura S(2022)A strict functional language with cyclic recursive dataFormal Aspects of Computing10.1007/BF012125269:1(78-97)Online publication date: 2-Jan-2022
https://dl.acm.org/doi/10.1007/BF01212526
Gibbons JKidney DSchrijvers TWu N(2022)Breadth-First Traversal via StagingMathematics of Program Construction10.1007/978-3-031-16912-0_1(1-33)Online publication date: 26-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-16912-0_1
Rouvoet Avan Antwerpen HBach Poulsen CKrebbers RVisser E(2020)Knowing when to ask: sound scheduling of name resolution in type checkers derived from declarative specificationsProceedings of the ACM on Programming Languages10.1145/34282484:OOPSLA(1-28)Online publication date: 13-Nov-2020
https://dl.acm.org/doi/10.1145/3428248
Hackett JHutton G(2019)Call-by-need is clairvoyant call-by-valueProceedings of the ACM on Programming Languages10.1145/33417183:ICFP(1-23)Online publication date: 26-Jul-2019
https://dl.acm.org/doi/10.1145/3341718
Vollmer MKoparkar CRainey MSakka LKulkarni MNewton RMcKinley KFisher K(2019)LoCal: a language for programs operating on serialized dataProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314631(48-62)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314631
Show More Cited By

Abstract

References

Cited By

Recommendations

Tools and libraries to model and manipulate circular programs

Using Circular Programs to Deforest in Accumulating Parameters

Design, Implementation and Calculation of Circular Programs: Multiple Traversal Algorithms in a Lazy Functional Setting

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations