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