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

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