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

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