120 Decks Ordered By Love Count - Highest First - Chse one - invert order

# Title Loves  
1 Folding Cheat Sheet #6 - Left and right folds and tail recursion 229  
2 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1 152  
3 N-Queens Combinatorial Puzzle meets Cats 146  
4 Direct Style Effect Systems - The Print[A] Example - A Comprehension Aid 142  
5 Definitions of Functional Programming 135  
6 Nat, List and Option Monoids - From scratch - Combining and Folding - An example 134  
7 Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists 113  
8 A Sighting of filterA in Typelevel Rite of Passage 109  
9 Computer Graphics in Java and Scala - Part 1b 106  
10 The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve 104  
11 Scala Left Fold Parallelisation - Three Approaches 103  
12 Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala 100  
13 Hand Rolled Applicative User Validation Code Kata 99  
14 Applicative Functor - Part 1 98  
15 The Expression Problem Part 1 97  
16 Scala 3 enum for a terser Option Monad Algebraic Data Type 96  
17 Tagless Final Encoding - Algebras and Interpreters and also Programs 94  
18 Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms 92  
19 Computer Graphics in Java and Scala - Part 1 91  
20 The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell 90  
21 Folding Cheat Sheet #7 - The three duality theorems of fold 88  
22 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3 86  
23 Game of Life - Polyglot FP - Haskell and Scala - Part 1 84  
24 Compositionality and Category Theory 84  
25 Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3 81  
26 Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala 80  
27 From Scala Monadic Effects to Unison Algebraic Effects 79  
28 Function Applicative for Great Good of Leap Year Function 79  
29 Folding Unfolded - Part 2 79  
30 Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java 78  
31 Monad Laws Must Be Checked 78  
32 Monad Fact #2 76  
33 The Functional Programming Triad of map, filter and fold 72  
34 Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold 71  
35 Folding Cheat Sheet #4 - For functions that can be defined both as a right fold and as a left fold, one may be more efficient than the other 71  
36 Applicative Functor - Part 2 71  
37 A sighting of traverseFilter and foldMap in Practical FP in Scala 70  
38 Applicative Functor - Part 3 70  
39 Folding Unfolded - Part 1 69  
40 Functor Laws 69  
41 Monad Fact #1 69  
42 Ad hoc Polymorphism using Type Classes and Cats 69  
43 Monad Fact #6 68  
44 Writer Monad for logging execution of functions 68  
45 Monoids - Part 2 - With examples using Scalaz and Cats 68  
46 Left and Right Folds - Comparison of a mathematical definition and a programmatic one 68  
47 Function Applicative for Great Good of Palindrome Checker Function 68  
48 Kleisli Composition 67  
49 Folding Cheat Sheet #3 - The universal property of fold 67  
50 Game of Life - Polyglot FP - Haskell and Scala - Part 2 67  
51 A sighting of traverse_ in Practical FP in Scala 67  
52 Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions 67  
53 The Expression Problem Part 2 67  
54 Monoids - Part 1 - With examples using Scalaz and Cats 66  
55 Sum and Product Types - The Fruit Salad & Fruit Snack Example 66  
56 Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions 65  
57 Folding Unfolded - Part 4 64  
58 Game of Life - Polyglot FP - Haskell and Scala - Part 3 64  
59 The Sieve of Eratosthenes - Part 1 64  
60 Natural Transformations 63  
61 Folding Cheat Sheet #8 - Folding with monoids 63  
62 The Debt Metaphor - Ward Cunningham in his 2009 YouTube video 63  
63 Sequence and Traverse - Part 3 63  
64 Monad Fact #4 63  
65 Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1 63  
66 Functional Effects - Part 2 62  
67 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4 62  
68 Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala 62  
69 The aggregate function - from sequential and parallel folds to parallel aggregation 61  
70 The Monad Fact Series 60  
71 Monad Fact #3 59  
72 Fusing Transformations of Strict Scala Collections with Views 59  
73 Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java 59  
74 Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example 59  
75 The Open-Closed Principle - Part 1 - The Original Version 59  
76 A sighting of sequence function in Practical FP in Scala 59  
77 Folding Unfolded - Part 3 59  
78 State Monad 58  
79 The Uniform Access Principle 58  
80 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2 57  
81 Monad Fact #5 57  
82 Functional Effects - Part 1 55  
83 Arrive at monads by going from composition of pure functions to composition of effectful functions 53  
84 Sequence and Traverse - Part 2 51  
85 Folding Unfolded - Part 5 50  
86 ‘go-to’ general-purpose sequential collections - from Java To Scala 50  
87 Sequence and Traverse - Part 1 50  
88 Folding Cheat Sheet Series Titles 49  
89 Fibonacci Function Gallery - Part 2 47  
90 Function Composition - forward composition versus backward composition 46  
91 Monads do not Compose 44  
92 Monad Transformers - Part 1 44  
93 From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example 44  
94 The Nature of Complexity in John Ousterhout’s Philosophy of Software Design 44  
95 Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2 43  
96 Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3 43  
97 Year when lambda functions were introduced in various languages 43  
98 Fibonacci Function Gallery - Part 1 41  
99 Monad as Functor with pair of Natural Transformations 41  
100 Functor Composition 40  
101 Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence 38  
102 Addendum to `Monads do not Compose` 36  
103 List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate' 35  
104 De Morgan's Laws are Monoid Homomorphisms 35  
105 Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate' 35  
106 Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity 33  
107 Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation 33  
108 Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication 33  
109 The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction 29  
110 Non-strict functions, bottom, and Scala by-name parameters 28  
111 Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1 28  
112 Point-free or Die - Tacit Programming in Haskell 25  
113 ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names 22  
114 Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1 19  
115 Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2 15  
116 Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code' 11  
117 AI Concepts - MCP Neurons 8  
118 Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to Github Copilot Chat - using Scala in IntelliJ IDEA 7  
119 The Functional Programming Triad of fold, scan and iterate 7  
120 Defining filter using (a) recursion (b) folding (c) folding with S, B and I combinators (d) folding with applicative functor and identity function 6