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

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