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

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