118 Decks Ordered By PDF Download Count - Highest First - Chse one - invert order

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