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

DOI10.1017/S0956796812000111zbMath1311.68047MaRDI QIDQ5398337

Masato Takeichi, Zhenjiang Hu, Kazuhiko Kakehi, Akimasa Morihata

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)

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Using circular programs to eliminate multiple traversals of data
• Deaccumulation techniques for improving provability
• Deforestation: Transforming programs to eliminate trees
• Improving recursive functions by inverting the order of evaluation
• Using circular programs to deforest in accumulating parameters
• Shortcut fusion for accumulating parameters & zip-like functions
• Algebraic fusion of functions with an accumulating parameter and its improvement
• A Grammar-Based Approach to Invertible Programs
• Continuation-Based Program Transformation Strategies
• Proving Theorems about LISP Functions
• A Transformation System for Developing Recursive Programs
• Composition of functions with accumulating parameters

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