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

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