Using circular programs to eliminate multiple traversals of data

DOI10.1007/BF00264249zbMath0551.68017OpenAlexW2070811535WikidataQ56450966 ScholiaQ56450966MaRDI QIDQ800713

Richard S. Bird

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264249

zbMATH Keywords

lazy evaluationlocal recursiontransforming functional programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)

Related Items (14)

Partial parametrization eliminates multiple traversals of data structures ⋮ A transformation method for dynamic-sized tabulation ⋮ Linear, bounded, functional pretty-printing ⋮ A strict functional language with cyclic recursive data ⋮ Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition ⋮ Shortcut fusion rules for the derivation of circular and higher-order programs ⋮ Breadth-first traversal via staging ⋮ A positive supercompiler ⋮ Unnamed Item ⋮ The resource constrained shortest path problem implemented in a lazy functional language ⋮ Manipulating accumulative functions by swapping call-time and return-time computations ⋮ Lazy dynamic-programming can be eager ⋮ Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers ⋮ Traced Premonoidal Categories

Cites Work

• DTL: A language for the design and implementation of concurrent programs as structured networks
• A System for Assisting Program Transformation
• A Transformation System for Developing Recursive Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using circular programs to eliminate multiple traversals of data