Using circular programs to deforest in accumulating parameters
From MaRDI portal
Publication:1768475
DOI10.1023/B:LISP.0000029450.36668.CBzbMath1075.68013OpenAlexW1964715477MaRDI QIDQ1768475
Publication date: 15 March 2005
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:lisp.0000029450.36668.cb
program transformationtree transducers(short cut) deforestationaccumulating argumentscircular programsintermediate resultstuplingunfold/fold
Related Items (6)
Deaccumulation techniques for improving provability ⋮ 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 ⋮ Algebraic fusion of functions with an accumulating parameter and its improvement ⋮ Manipulating accumulative functions by swapping call-time and return-time computations ⋮ Semantics and Pragmatics of New Shortcut Fusion Rules
This page was built for publication: Using circular programs to deforest in accumulating parameters
