Using circular programs to deforest in accumulating parameters

DOI10.1023/B:LISP.0000029450.36668.CBMaRDI QIDQ1768475zbMATH OpenOpenAlexFDO

Authors Janis Voigtländer

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

zbMATH Keywords

(short cut) deforestationaccumulating argumentscircular programsintermediate resultsprogram transformationtree transducerstuplingunfold/fold

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Using circular programs to eliminate multiple traversals of data
• scientific article; zbMATH DE number 2090115
• Composition of functions with accumulating parameters
• scientific article; zbMATH DE number 1696590
• scientific article; zbMATH DE number 1808202

Cited in

(9)

• Shortcut fusion rules for the derivation of circular and higher-order programs
• Algebraic fusion of functions with an accumulating parameter and its improvement
• Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
• Composition of functions with accumulating parameters
• scientific article; zbMATH DE number 2090115 (Why is no real title available?)
• Manipulating accumulative functions by swapping call-time and return-time computations
• Semantics and Pragmatics of New Shortcut Fusion Rules
• Using circular programs to eliminate multiple traversals of data
• Deaccumulation techniques for improving provability

This page was built for publication: Using circular programs to deforest in accumulating parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768475)