Manipulating accumulative functions by swapping call-time and return-time computations

DOI10.1017/S0956796812000111MaRDI QIDQ5398337zbMATH OpenFDO

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

Publication date 27 February 2014

Published in Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1808202
• The Substitution Vanishes
• Swapping Arguments and Results of Recursive Functions
• Using circular programs to deforest in accumulating parameters
• Point-free program transformation

Cites work

• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• A grammar-based approach to invertible programs
• Algebraic fusion of functions with an accumulating parameter and its improvement
• Composition of functions with accumulating parameters
• Continuation-Based Program Transformation Strategies
• Deaccumulation techniques for improving provability
• Deforestation: Transforming programs to eliminate trees
• Improving recursive functions by inverting the order of evaluation
• Proving Theorems about LISP Functions
• Shortcut fusion for accumulating parameters & zip-like functions
• Using circular programs to deforest in accumulating parameters
• Using circular programs to eliminate multiple traversals of data

Cited in

(2)

• Swapping Arguments and Results of Recursive Functions
• scientific article; zbMATH DE number 1808202 (Why is no real title available?)

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Manipulating accumulative functions by swapping call-time and return-time computations

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