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