123 Decks Ordered By Applause Count - Lowest First - Chse one - invert order

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