124 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	12050
2	N-Queens Combinatorial Puzzle meets Cats	6367
3	The Open-Closed Principle - Part 1 - The Original Version	5698
4	Folding Cheat Sheet #6 - Left and right folds and tail recursion	5519
5	Monad Laws Must Be Checked	4891
6	Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions	4616
7	Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists	3846
8	The Bowling Game - From Imperative to Functional Programming - Part 1	3565
9	Fibonacci Function Gallery - Part 2	3189
10	List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	3161
11	Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3	3050
12	The Functional Programming Triad of map, filter and fold	2979
13	Folding Cheat Sheet #7 - The three duality theorems of fold	2884
14	Function Applicative for Great Good of Leap Year Function	2860
15	Fibonacci Function Gallery - Part 1	2857
16	Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold	2723
17	Folding Cheat Sheet #3 - The universal property of fold	2690
18	The Expression Problem Part 2	2570
19	The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction	2559
20	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1	2478
21	Folding Cheat Sheet #8 - Folding with monoids	2473
22	The Bowling Game - From Imperative to Functional Programming - Part 2	2452
23	Tagless Final Encoding - Algebras and Interpreters and also Programs	2432
24	ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names	2407
25	A Sighting of filterA in Typelevel Rite of Passage	2368
26	Hand Rolled Applicative User Validation Code Kata	2314
27	Point-free or Die - Tacit Programming in Haskell	2310
28	From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example	2143
29	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	2096
30	Abstracting over Execution with Higher Kinded Types, and how to remain Purely Functional	1964
31	The Nature of Complexity in John Ousterhout’s Philosophy of Software Design	1963
32	Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	1937
33	Compositionality and Category Theory	1933
34	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2	1859
35	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java	1843
36	AI Concepts - MCP Neurons	1839
37	Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation	1817
38	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code'	1810
39	Scala Left Fold Parallelisation - Three Approaches	1701
40	Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication	1617
41	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1	1600
42	Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1	1558
43	Computer Graphics in Java and Scala - Part 1	1556
44	The Expression Problem Part 1	1551
45	The Bowling Game - From Imperative to Functional Programming - Part 3	1545
46	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala	1542
47	Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity	1538
48	The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve	1531
49	From Scala Monadic Effects to Unison Algebraic Effects	1529
50	Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java	1527
51	Scala 3 enum for a terser Option Monad Algebraic Data Type	1498
52	Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala	1489
53	Applicative Functor - Part 2	1475
54	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to Github Copilot Chat - using Scala in IntelliJ IDEA	1462
55	Game of Life - Polyglot FP - Haskell and Scala - Part 1	1456
56	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3	1444
57	Computer Graphics in Java and Scala - Part 1b	1434
58	Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions	1427
59	Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3	1405
60	The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell	1401
61	Definitions of Functional Programming	1399
62	Nat, List and Option Monoids - From scratch - Combining and Folding - An example	1397
63	Folding Unfolded - Part 1	1390
64	Folding Unfolded - Part 2	1386
65	The Sieve of Eratosthenes - Part 1	1377
66	Kleisli Composition	1355
67	Applicative Functor - Part 1	1348
68	Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala	1322
69	The Debt Metaphor - Ward Cunningham in his 2009 YouTube video	1293
70	Monad Fact #1	1281
71	A sighting of traverse_ in Practical FP in Scala	1276
72	The Monad Fact Series	1266
73	Monad Fact #4	1259
74	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2	1254
75	‘go-to’ general-purpose sequential collections - from Java To Scala	1249
76	The Uniform Access Principle	1233
77	Sum and Product Types - The Fruit Salad & Fruit Snack Example	1232
78	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4	1232
79	Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example	1230
80	Folding Unfolded - Part 5	1222
81	A sighting of sequence function in Practical FP in Scala	1219
82	Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms	1215
83	Folding Unfolded - Part 3	1212
84	Applicative Functor - Part 3	1207
85	A sighting of traverseFilter and foldMap in Practical FP in Scala	1205
86	Arrive at monads by going from composition of pure functions to composition of effectful functions	1201
87	Monad Fact #3	1188
88	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1	1186
89	Functor Laws	1185
90	Monad Fact #5	1184
91	Function Applicative for Great Good of Palindrome Checker Function	1181
92	The aggregate function - from sequential and parallel folds to parallel aggregation	1171
93	Fusing Transformations of Strict Scala Collections with Views	1167
94	Folding Unfolded - Part 4	1166
95	Folding Cheat Sheet Series Titles	1163
96	Monad Fact #6	1156
97	Game of Life - Polyglot FP - Haskell and Scala - Part 3	1145
98	Monad Fact #2	1138
99	Game of Life - Polyglot FP - Haskell and Scala - Part 2	1118
100	Functional Effects - Part 1	1118
101	Monoids - Part 1 - With examples using Scalaz and Cats	1108
102	Functional Effects - Part 2	1108
103	Sequence and Traverse - Part 1	1103
104	Left and Right Folds - Comparison of a mathematical definition and a programmatic one	1099
105	Sequence and Traverse - Part 2	1093
106	Sequence and Traverse - Part 3	1090
107	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2	1088
108	State Monad	1084
109	Monoids - Part 2 - With examples using Scalaz and Cats	1083
110	Ad hoc Polymorphism using Type Classes and Cats	1050
111	Natural Transformations	1048
112	Writer Monad for logging execution of functions	1038
113	The Functional Programming Triad of fold, scan and iterate	1012
114	Monads do not Compose	944
115	Function Composition - forward composition versus backward composition	929
116	Functor Composition	904
117	Defining filter using (a) recursion (b) folding (c) folding with S, B and I combinators (d) folding with applicative functor and identity function	897
118	Monad Transformers - Part 1	894
119	Monad as Functor with pair of Natural Transformations	892
120	Addendum to `Monads do not Compose`	890
121	Year when lambda functions were introduced in various languages	835
122	De Morgan's Laws are Monoid Homomorphisms	826
123	Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence	818
124	Non-strict functions, bottom, and Scala by-name parameters	754