I'm trying to create an Observable where each item is produced via an asynchronous task. The next item should be produced via an async call on the result of the previous item (co-recursion). In "Ge...

This is a corecursive algorithm, because with each iteration it calls itself on data that is greater then what it had before: iterate f x = x : iterate f (f x) It is similar to tail recursion ac...

I want to write Foldable.toList for a non-empty rose tree using an anamorphism, but it seems impossible to extract the last element: import Data.Functor.Foldable data RoseTree a = RoseNode a [Ros...

I'm playing around with the language to start learning and I am puzzled beyond my wits about how a recursive definition works. For example, let's take the sequence of the Triangular numbers (TN n ...

I've defined the infinite list of infinite lists pathCounts and the infinite list of finite lists pathCounts': import Data.Function (fix) nextRow xs = fix $ \ys -> zipWith (+) xs (0:ys) pathC...

I'm working on a C++ project that requires frequent interaction with a tree structure, which means lots of recursive functions, and I'm looking for ways to improve the code. I came across corecursi...

I implemented a broken filter function using an anamorphism from recursion-schemes Hackage library: import Data.Functor.Foldable xfilter :: (a -> Bool) -> [a] -> [a] xfilter f = ana $ pr...