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

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