Using circular programs to eliminate multiple traversals of data
type: Item
instance of: scholarly article
title: Using circular programs to eliminate multiple traversals of data
zbMATH Open document ID: 0551.68017
DOI: 10.1007/BF00264249
published in: Acta Informatica
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 3878335
zbMATH Keywords: transforming functional programs
zbMATH Keywords: lazy evaluation
zbMATH Keywords: local recursion
Wikidata QID: Q56450966
author: Richard S. Bird
MaRDI profile type: Publication
cites work: Q4133082
cites work: A Transformation System for Developing Recursive Programs
cites work: A System for Assisting Program Transformation
cites work: Q3862437
cites work: DTL: A language for the design and implementation of concurrent programs as structured networks
cites work: Q4192941
cites work: Q3729997
full work available at URL: https://doi.org/10.1007/bf00264249
OpenAlex ID: W2070811535
description: scientific article; zbMATH DE number 3878335