Tag
This blog post describes the prototyping of a genetic algorithms library in Haskell, using recursion schemes and monadic computations for context, with code examples and resource references.
This post discusses methods to conduct Dijkstra's algorithm directly on algebraic graph representations without converting to adjacency maps, leveraging graph compression techniques.
A talk tracing the evolution from goto spaghetti to structured loops and finally to recursion schemes, showing how control-flow abstractions mirror data structures and why most languages still hide the best combinators.
The Effekt programming language blog post demonstrates how to implement recursion schemes (particularly catamorphisms) using effects and handlers instead of traditional functor-based approaches, avoiding the need for infinitely recursive types.