123 Decks Ordered By Thumbs Up Count - Highest First - Chse one - invert order

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