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

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