From 684f85b1ec55014b8e7642a1f032fc620a685f7d Mon Sep 17 00:00:00 2001 From: Luc Tielen Date: Mon, 29 Mar 2021 08:48:07 +0200 Subject: [PATCH] Add article --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 5d5d0b7..d04ec72 100644 --- a/README.md +++ b/README.md @@ -48,6 +48,7 @@ Recursion schemes are simple, composable combinators, that automate the process - [Correcting the Visitor pattern](http://logji.blogspot.co.uk/2012/02/correcting-visitor-pattern.html) - Showing that the Visitor pattern implements an f-algebra for use with a catamorphism (in Java). - [Recursion Schemes in Scala](https://free.cofree.io/2017/11/13/recursion/) - Introduces the fixpoint combinator, anamorphism, catamorphism, hylomorphism, paramorphism, apomorphism, histomorphism, dynamorphism and futumorphism. - [What's in a Fold: The Basic Catamorphism in recursion-schemes](https://duplode.github.io/posts/whats-in-a-fold.html) - Introduces catamorphism as a generalization of fold. +- [Combining folds using semigroups](https://luctielen.com/posts/combining_folds_using_semigroups/) - Uses semigroups to combine many recursion schemes folds into one. ### Hylomorphisms in the Wild