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	11661
2	N-Queens Combinatorial Puzzle meets Cats	6107
3	The Open-Closed Principle - Part 1 - The Original Version	5456
4	Folding Cheat Sheet #6 - Left and right folds and tail recursion	5299
5	Monad Laws Must Be Checked	4663
6	Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions	4380
7	Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists	3794
8	The Bowling Game - From Imperative to Functional Programming - Part 1	3367
9	Fibonacci Function Gallery - Part 2	3126
10	List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	3088
11	Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3	3000
12	The Functional Programming Triad of map, filter and fold	2899
13	Folding Cheat Sheet #7 - The three duality theorems of fold	2841
14	Fibonacci Function Gallery - Part 1	2795
15	Function Applicative for Great Good of Leap Year Function	2792
16	Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold	2644
17	Folding Cheat Sheet #3 - The universal property of fold	2640
18	The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction	2516
19	Folding Cheat Sheet #8 - Folding with monoids	2425
20	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1	2401
21	Tagless Final Encoding - Algebras and Interpreters and also Programs	2383
22	The Expression Problem Part 2	2372
23	ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names	2350
24	A Sighting of filterA in Typelevel Rite of Passage	2313
25	The Bowling Game - From Imperative to Functional Programming - Part 2	2310
26	Hand Rolled Applicative User Validation Code Kata	2251
27	Point-free or Die - Tacit Programming in Haskell	2238
28	From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example	2082
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	2049
30	The Nature of Complexity in John Ousterhout’s Philosophy of Software Design	1896
31	Compositionality and Category Theory	1878
32	Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	1877
33	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2	1804
34	Abstracting over Execution with Higher Kinded Types, and how to remain Purely Functional	1787
35	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java	1780
36	AI Concepts - MCP Neurons	1767
37	Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation	1758
38	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code'	1737
39	Scala Left Fold Parallelisation - Three Approaches	1624
40	Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication	1554
41	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1	1549
42	The Expression Problem Part 1	1513
43	Computer Graphics in Java and Scala - Part 1	1509
44	Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1	1498
45	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala	1483
46	Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java	1481
47	From Scala Monadic Effects to Unison Algebraic Effects	1479
48	Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity	1478
49	The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve	1474
50	Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala	1436
51	Scala 3 enum for a terser Option Monad Algebraic Data Type	1436
52	Applicative Functor - Part 2	1415
53	Game of Life - Polyglot FP - Haskell and Scala - Part 1	1404
54	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to Github Copilot Chat - using Scala in IntelliJ IDEA	1401
55	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3	1392
56	Computer Graphics in Java and Scala - Part 1b	1382
57	Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions	1377
58	Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3	1362
59	Definitions of Functional Programming	1356
60	Nat, List and Option Monoids - From scratch - Combining and Folding - An example	1351
61	The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell	1350
62	Folding Unfolded - Part 1	1334
63	The Sieve of Eratosthenes - Part 1	1331
64	Folding Unfolded - Part 2	1323
65	Kleisli Composition	1304
66	Applicative Functor - Part 1	1298
67	Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala	1273
68	The Debt Metaphor - Ward Cunningham in his 2009 YouTube video	1237
69	Monad Fact #1	1235
70	A sighting of traverse_ in Practical FP in Scala	1230
71	The Monad Fact Series	1221
72	Monad Fact #4	1216
73	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2	1209
74	‘go-to’ general-purpose sequential collections - from Java To Scala	1200
75	Sum and Product Types - The Fruit Salad & Fruit Snack Example	1186
76	The Uniform Access Principle	1183
77	Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example	1180
78	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4	1179
79	Folding Unfolded - Part 5	1175
80	A sighting of sequence function in Practical FP in Scala	1175
81	Folding Unfolded - Part 3	1171
82	Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms	1168
83	Applicative Functor - Part 3	1167
84	A sighting of traverseFilter and foldMap in Practical FP in Scala	1166
85	Arrive at monads by going from composition of pure functions to composition of effectful functions	1164
86	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1	1142
87	Monad Fact #3	1139
88	Monad Fact #5	1136
89	Function Applicative for Great Good of Palindrome Checker Function	1135
90	Functor Laws	1135
91	The aggregate function - from sequential and parallel folds to parallel aggregation	1123
92	Folding Unfolded - Part 4	1118
93	Fusing Transformations of Strict Scala Collections with Views	1118
94	Folding Cheat Sheet Series Titles	1112
95	Monad Fact #6	1110
96	Monad Fact #2	1101
97	Game of Life - Polyglot FP - Haskell and Scala - Part 3	1100
98	Game of Life - Polyglot FP - Haskell and Scala - Part 2	1077
99	Functional Effects - Part 1	1076
100	Monoids - Part 1 - With examples using Scalaz and Cats	1063
101	Functional Effects - Part 2	1062
102	Sequence and Traverse - Part 1	1061
103	Left and Right Folds - Comparison of a mathematical definition and a programmatic one	1053
104	Sequence and Traverse - Part 3	1047
105	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2	1047
106	Sequence and Traverse - Part 2	1044
107	State Monad	1043
108	Monoids - Part 2 - With examples using Scalaz and Cats	1039
109	Ad hoc Polymorphism using Type Classes and Cats	1007
110	Natural Transformations	1007
111	Writer Monad for logging execution of functions	992
112	The Functional Programming Triad of fold, scan and iterate	964
113	Monads do not Compose	902
114	Function Composition - forward composition versus backward composition	882
115	Functor Composition	859
116	Monad Transformers - Part 1	853
117	Addendum to `Monads do not Compose`	849
118	Defining filter using (a) recursion (b) folding (c) folding with S, B and I combinators (d) folding with applicative functor and identity function	844
119	Monad as Functor with pair of Natural Transformations	837
120	Year when lambda functions were introduced in various languages	790
121	De Morgan's Laws are Monoid Homomorphisms	790
122	The Bowling Game - From Imperative to Functional Programming - Part 3	789
123	Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence	779
124	Non-strict functions, bottom, and Scala by-name parameters	707