Folding left and right matters: Direct style, accumulators, and continuations

DOI10.1017/s0956796822000156OpenAlexW4320732558MaRDI QIDQ6099203

Olivier Danvy

Publication date: 19 June 2023

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

Full work available at URL: https://doi.org/10.1017/s0956796822000156

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
• Classical recursion theory. The theory of functions and sets of natural numbers
• Paramorphisms
• Factorising folds for faster functions
• Functional Pearls
• Lightweight fusion by fixed point promotion
• On the power of list iteration
• A Transformation System for Developing Recursive Programs
• Origins of Recursive Function Theory
• A tutorial on the universality and expressiveness of fold
• Folding left and right over Peano numbers
• Proving Properties of Programs by Structural Induction
• The Equivalence of Certain Computations
• The Calculi of Lambda Conversion. (AM-6)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Folding left and right matters: Direct style, accumulators, and continuations