Deriving structural hylomorphisms from recursive definitions

DOI10.1145/232627.232637zbMath1345.68059OpenAlexW1975580206MaRDI QIDQ2817685

Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi

Publication date: 1 September 2016

Published in: Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/232627.232637

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Pruning with improving sequences in lazy functional programs ⋮ Contract lenses: Reasoning about bidirectional programs via calculation ⋮ Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ The Expression Lemma ⋮ When is a function a fold or an unfold? ⋮ Denotation by Transformation

This page was built for publication: Deriving structural hylomorphisms from recursive definitions