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

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