Fantastic morphisms and where to find them. A guide to recursion schemes

DOI10.1007/978-3-031-16912-0_9arXiv2202.13633MaRDI QIDQ6164203

Nicolas Wu, Zhixuan Yang

Publication date: 30 June 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.13633

zbMATH Keywords

equational reasoningHaskellgeneric programmingrecursion schemes(co)inductive datatypes(un)folds

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data structures and program transformation
• A principled approach to programming with nested types in Haskell
• Metamorphisms: streaming representation-changers
• Paramorphisms
• Generic downwards accumulations
• Iteration and coiteration schemes for higher-order and nested datatypes
• Generalised folds for nested datatypes
• Coding with asymmetric numeral systems
• Recursive coalgebras from comonads
• A fixpoint theorem for complete categories
• Deriving structural hylomorphisms from recursive definitions
• Folding domain-specific languages
• Conjugate Hylomorphisms -- Or
• Comonadic Notions of Computation
• Foundations for structured programming with GADTs
• Algorithm Design with Haskell
• Initial Algebra Semantics Is Enough!
• Recursion Schemes for Dynamic Programming
• de Bruijn notation as a nested datatype
• Generic Programming with Adjunctions
• Fold and unfold for program semantics
• Unifying structured recursion schemes
• Unifying structured recursion schemes
• Advanced Functional Programming
• A Duality of Sorts

This page was built for publication: Fantastic morphisms and where to find them. A guide to recursion schemes