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

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