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

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