Swapping Arguments and Results of Recursive Functions

DOI10.1007/11783596_22MaRDI QIDQ3618833zbMATH OpenOpenAlexFDO

Authors Akimasa Morihata, Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi

Publication date 2 April 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Manipulating accumulative functions by swapping call-time and return-time computations
• Tupling calculation eliminates multiple data traversals
• Point-free program transformation
• scientific article; zbMATH DE number 2087343
• Shortcut fusion rules for the derivation of circular and higher-order programs

Cited in

(3)

• Deaccumulation techniques for improving provability
• Manipulating accumulative functions by swapping call-time and return-time computations
• Getting There and Back Again

This page was built for publication: Swapping Arguments and Results of Recursive Functions

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