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