124 Decks Ordered By Applause Count - Highest First - Chse one - invert order

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