123 Decks Ordered By View Count - Highest First - Chse one - invert order

#	Title	Views
1	Direct Style Effect Systems - The Print[A] Example - A Comprehension Aid	11378
2	N-Queens Combinatorial Puzzle meets Cats	5897
3	The Open-Closed Principle - Part 1 - The Original Version	5266
4	Folding Cheat Sheet #6 - Left and right folds and tail recursion	5108
5	Monad Laws Must Be Checked	4492
6	Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions	4183
7	Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists	3753
8	The Bowling Game - From Imperative to Functional Programming - Part 1	3208
9	Fibonacci Function Gallery - Part 2	3075
10	List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	3015
11	Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3	2957
12	The Functional Programming Triad of map, filter and fold	2850
13	Folding Cheat Sheet #7 - The three duality theorems of fold	2811
14	Fibonacci Function Gallery - Part 1	2752
15	Function Applicative for Great Good of Leap Year Function	2740
16	Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold	2614
17	Folding Cheat Sheet #3 - The universal property of fold	2603
18	The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction	2481
19	Folding Cheat Sheet #8 - Folding with monoids	2396
20	Tagless Final Encoding - Algebras and Interpreters and also Programs	2342
21	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1	2329
22	ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names	2298
23	A Sighting of filterA in Typelevel Rite of Passage	2278
24	The Expression Problem Part 2	2228
25	Hand Rolled Applicative User Validation Code Kata	2204
26	Point-free or Die - Tacit Programming in Haskell	2203
27	From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example	2038
28	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	2008
29	The Bowling Game - From Imperative to Functional Programming - Part 2	1952
30	The Nature of Complexity in John Ousterhout’s Philosophy of Software Design	1851
31	Compositionality and Category Theory	1847
32	Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	1835
33	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2	1753
34	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java	1739
35	AI Concepts - MCP Neurons	1712
36	Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation	1700
37	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code'	1687
38	Abstracting over Execution with Higher Kinded Types, and how to remain Purely Functional	1632
39	Scala Left Fold Parallelisation - Three Approaches	1584
40	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1	1518
41	Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication	1507
42	The Expression Problem Part 1	1486
43	Computer Graphics in Java and Scala - Part 1	1479
44	Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java	1451
45	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala	1442
46	From Scala Monadic Effects to Unison Algebraic Effects	1437
47	Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1	1435
48	The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve	1434
49	Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity	1428
50	Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala	1394
51	Scala 3 enum for a terser Option Monad Algebraic Data Type	1393
52	Applicative Functor - Part 2	1383
53	Game of Life - Polyglot FP - Haskell and Scala - Part 1	1364
54	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3	1350
55	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to Github Copilot Chat - using Scala in IntelliJ IDEA	1348
56	Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions	1343
57	Computer Graphics in Java and Scala - Part 1b	1340
58	Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3	1336
59	Definitions of Functional Programming	1327
60	The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell	1320
61	Nat, List and Option Monoids - From scratch - Combining and Folding - An example	1316
62	The Sieve of Eratosthenes - Part 1	1305
63	Folding Unfolded - Part 1	1294
64	Folding Unfolded - Part 2	1281
65	Kleisli Composition	1279
66	Applicative Functor - Part 1	1268
67	Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala	1239
68	The Debt Metaphor - Ward Cunningham in his 2009 YouTube video	1209
69	Monad Fact #1	1207
70	The Monad Fact Series	1198
71	A sighting of traverse_ in Practical FP in Scala	1198
72	Monad Fact #4	1183
73	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2	1172
74	‘go-to’ general-purpose sequential collections - from Java To Scala	1162
75	Sum and Product Types - The Fruit Salad & Fruit Snack Example	1154
76	The Uniform Access Principle	1151
77	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4	1150
78	A sighting of sequence function in Practical FP in Scala	1149
79	Folding Unfolded - Part 5	1146
80	Folding Unfolded - Part 3	1142
81	Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms	1138
82	Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example	1138
83	Applicative Functor - Part 3	1137
84	A sighting of traverseFilter and foldMap in Practical FP in Scala	1134
85	Arrive at monads by going from composition of pure functions to composition of effectful functions	1131
86	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1	1117
87	Monad Fact #3	1108
88	Monad Fact #5	1106
89	Functor Laws	1103
90	Function Applicative for Great Good of Palindrome Checker Function	1100
91	Fusing Transformations of Strict Scala Collections with Views	1088
92	The aggregate function - from sequential and parallel folds to parallel aggregation	1088
93	Folding Unfolded - Part 4	1087
94	Monad Fact #6	1085
95	Folding Cheat Sheet Series Titles	1078
96	Monad Fact #2	1076
97	Game of Life - Polyglot FP - Haskell and Scala - Part 3	1067
98	Functional Effects - Part 1	1052
99	Game of Life - Polyglot FP - Haskell and Scala - Part 2	1050
100	Monoids - Part 1 - With examples using Scalaz and Cats	1035
101	Sequence and Traverse - Part 1	1034
102	Functional Effects - Part 2	1031
103	Left and Right Folds - Comparison of a mathematical definition and a programmatic one	1022
104	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2	1021
105	Monoids - Part 2 - With examples using Scalaz and Cats	1016
106	Sequence and Traverse - Part 3	1015
107	Sequence and Traverse - Part 2	1011
108	State Monad	1008
109	Natural Transformations	976
110	Ad hoc Polymorphism using Type Classes and Cats	970
111	Writer Monad for logging execution of functions	968
112	The Functional Programming Triad of fold, scan and iterate	912
113	Monads do not Compose	862
114	Function Composition - forward composition versus backward composition	848
115	Monad Transformers - Part 1	830
116	Functor Composition	829
117	Addendum to `Monads do not Compose`	819
118	Monad as Functor with pair of Natural Transformations	804
119	Defining filter using (a) recursion (b) folding (c) folding with S, B and I combinators (d) folding with applicative functor and identity function	803
120	Year when lambda functions were introduced in various languages	766
121	De Morgan's Laws are Monoid Homomorphisms	759
122	Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence	750
123	Non-strict functions, bottom, and Scala by-name parameters	678