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

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