A tutorial on the universality and expressiveness of fold
From MaRDI portal
Publication:4943357
DOI10.1017/S0956796899003500zbMath0948.68036WikidataQ128379252 ScholiaQ128379252MaRDI QIDQ4943357
Publication date: 16 March 2000
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items
Supercompilation for Martin-Lof's type theory ⋮ Loop verification with invariants and contracts ⋮ Functional un\(|\)unparsing ⋮ Folding left and right matters: Direct style, accumulators, and continuations ⋮ Semantically restricted argument dependencies ⋮ Unnamed Item ⋮ Understanding beginners' mistakes with Haskell ⋮ Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits ⋮ When is a function a fold or an unfold? ⋮ The worker/wrapper transformation ⋮ Factorising folds for faster functions ⋮ Modular Dependent Induction in Coq, Mendler-Style
