111 Decks Ordered By Love Count - Lowest First - Chse one - invert order

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