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	11091
2	N-Queens Combinatorial Puzzle meets Cats	5727
3	The Open-Closed Principle - Part 1 - The Original Version	5086
4	Folding Cheat Sheet #6 - Left and right folds and tail recursion	4957
5	Monad Laws Must Be Checked	4337
6	Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions	4037
7	Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists	3727
8	The Bowling Game - From Imperative to Functional Programming - Part 1	3066
9	Fibonacci Function Gallery - Part 2	3036
10	List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	2975
11	Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3	2918
12	The Functional Programming Triad of map, filter and fold	2791
13	Folding Cheat Sheet #7 - The three duality theorems of fold	2784
14	Fibonacci Function Gallery - Part 1	2711
15	Function Applicative for Great Good of Leap Year Function	2699
16	Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold	2587
17	Folding Cheat Sheet #3 - The universal property of fold	2575
18	The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction	2442
19	Folding Cheat Sheet #8 - Folding with monoids	2370
20	Tagless Final Encoding - Algebras and Interpreters and also Programs	2310
21	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1	2281
22	ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names	2260
23	A Sighting of filterA in Typelevel Rite of Passage	2251
24	Point-free or Die - Tacit Programming in Haskell	2183
25	Hand Rolled Applicative User Validation Code Kata	2167
26	The Expression Problem Part 2	2083
27	From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example	1999
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	1977
29	Compositionality and Category Theory	1820
30	The Nature of Complexity in John Ousterhout’s Philosophy of Software Design	1813
31	Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	1801
32	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2	1720
33	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java	1707
34	Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation	1671
35	AI Concepts - MCP Neurons	1667
36	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code'	1648
37	Scala Left Fold Parallelisation - Three Approaches	1551
38	Abstracting over Execution with Higher Kinded Types, and how to remain Purely Functional	1540
39	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1	1492
40	The Expression Problem Part 1	1463
41	Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication	1462
42	Computer Graphics in Java and Scala - Part 1	1438
43	Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java	1424
44	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala	1413
45	From Scala Monadic Effects to Unison Algebraic Effects	1405
46	The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve	1401
47	Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1	1401
48	Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity	1397
49	Scala 3 enum for a terser Option Monad Algebraic Data Type	1366
50	Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala	1362
51	Applicative Functor - Part 2	1349
52	Game of Life - Polyglot FP - Haskell and Scala - Part 1	1329
53	Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions	1318
54	Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3	1316
55	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3	1316
56	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to Github Copilot Chat - using Scala in IntelliJ IDEA	1309
57	Computer Graphics in Java and Scala - Part 1b	1307
58	Definitions of Functional Programming	1304
59	The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell	1290
60	Nat, List and Option Monoids - From scratch - Combining and Folding - An example	1282
61	The Sieve of Eratosthenes - Part 1	1272
62	Folding Unfolded - Part 1	1262
63	Kleisli Composition	1254
64	Folding Unfolded - Part 2	1245
65	Applicative Functor - Part 1	1236
66	Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala	1209
67	The Debt Metaphor - Ward Cunningham in his 2009 YouTube video	1183
68	Monad Fact #1	1183
69	A sighting of traverse_ in Practical FP in Scala	1170
70	The Monad Fact Series	1169
71	Monad Fact #4	1154
72	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2	1144
73	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4	1130
74	Sum and Product Types - The Fruit Salad & Fruit Snack Example	1129
75	The Uniform Access Principle	1128
76	A sighting of sequence function in Practical FP in Scala	1127
77	‘go-to’ general-purpose sequential collections - from Java To Scala	1124
78	Folding Unfolded - Part 5	1123
79	Folding Unfolded - Part 3	1114
80	Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example	1111
81	Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms	1110
82	Applicative Functor - Part 3	1109
83	A sighting of traverseFilter and foldMap in Practical FP in Scala	1107
84	Arrive at monads by going from composition of pure functions to composition of effectful functions	1100
85	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1	1092
86	Functor Laws	1080
87	Monad Fact #5	1080
88	Monad Fact #3	1079
89	Function Applicative for Great Good of Palindrome Checker Function	1076
90	Monad Fact #6	1068
91	Fusing Transformations of Strict Scala Collections with Views	1066
92	Folding Unfolded - Part 4	1062
93	Folding Cheat Sheet Series Titles	1055
94	The aggregate function - from sequential and parallel folds to parallel aggregation	1052
95	Monad Fact #2	1047
96	Game of Life - Polyglot FP - Haskell and Scala - Part 3	1046
97	Functional Effects - Part 1	1030
98	Game of Life - Polyglot FP - Haskell and Scala - Part 2	1029
99	Functional Effects - Part 2	1005
100	Sequence and Traverse - Part 1	1004
101	Monoids - Part 1 - With examples using Scalaz and Cats	1003
102	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2	998
103	Left and Right Folds - Comparison of a mathematical definition and a programmatic one	994
104	Sequence and Traverse - Part 3	993
105	Sequence and Traverse - Part 2	986
106	State Monad	984
107	Monoids - Part 2 - With examples using Scalaz and Cats	984
108	Natural Transformations	951
109	Ad hoc Polymorphism using Type Classes and Cats	945
110	Writer Monad for logging execution of functions	945
111	The Functional Programming Triad of fold, scan and iterate	878
112	Monads do not Compose	836
113	Function Composition - forward composition versus backward composition	823
114	Monad Transformers - Part 1	809
115	Functor Composition	806
116	Addendum to `Monads do not Compose`	794
117	Monad as Functor with pair of Natural Transformations	780
118	Defining filter using (a) recursion (b) folding (c) folding with S, B and I combinators (d) folding with applicative functor and identity function	778
119	Year when lambda functions were introduced in various languages	738
120	De Morgan's Laws are Monoid Homomorphisms	738
121	Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence	725
122	Non-strict functions, bottom, and Scala by-name parameters	654
123	The Bowling Game - From Imperative to Functional Programming - Part 2	219