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

DOI10.1017/S0956796812000111zbMATH Open1311.68047MaRDI QIDQ5398337FDOQ5398337

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)

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

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

Cited In (2)

• Swapping Arguments and Results of Recursive Functions
• Title not available (Why is that?)

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)