Folding left and right over Peano numbers

DOI10.1017/S0956796819000042zbMath1493.68084OpenAlexW2939431570WikidataQ128038576 ScholiaQ128038576MaRDI QIDQ4972067

Olivier Danvy

Publication date: 22 November 2019

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

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant ⋮ Folding left and right matters: Direct style, accumulators, and continuations

Cites Work

• Unnamed Item
• Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
• Paramorphisms
• Lightweight fusion by fixed point promotion
• On the power of list iteration
• A Transformation System for Developing Recursive Programs
• Origins of Recursive Function Theory
• On Barron and Strachey's cartesian product function

This page was built for publication: Folding left and right over Peano numbers