117 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	9138
2	N-Queens Combinatorial Puzzle meets Cats	4062
3	The Open-Closed Principle - Part 1 - The Original Version	3895
4	Folding Cheat Sheet #6 - Left and right folds and tail recursion	3690
5	Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists	3414
6	Monad Laws Must Be Checked	3237
7	Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions	2930
8	Fibonacci Function Gallery - Part 2	2705
9	List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	2624
10	Folding Cheat Sheet #7 - The three duality theorems of fold	2449
11	Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3	2394
12	The Functional Programming Triad of map, filter and fold	2388
13	Fibonacci Function Gallery - Part 1	2377
14	Function Applicative for Great Good of Leap Year Function	2363
15	Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold	2284
16	Folding Cheat Sheet #3 - The universal property of fold	2271
17	The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction	2115
18	Folding Cheat Sheet #8 - Folding with monoids	2079
19	A Sighting of filterA in Typelevel Rite of Passage	1982
20	Tagless Final Encoding - Algebras and Interpreters and also Programs	1939
21	ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names	1877
22	Point-free or Die - Tacit Programming in Haskell	1876
23	Hand Rolled Applicative User Validation Code Kata	1806
24	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	1699
25	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1	1665
26	From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example	1662
27	Compositionality and Category Theory	1545
28	Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	1518
29	The Nature of Complexity in John Ousterhout’s Philosophy of Software Design	1463
30	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2	1351
31	Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation	1325
32	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java	1295
33	Scala Left Fold Parallelisation - Three Approaches	1259
34	The Expression Problem Part 1	1225
35	AI Concepts - MCP Neurons	1161
36	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1	1159
37	Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication	1146
38	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code'	1132
39	Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java	1119
40	The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve	1108
41	The Expression Problem Part 2	1101
42	Computer Graphics in Java and Scala - Part 1	1087
43	Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity	1073
44	Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1	1066
45	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala	1054
46	Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala	1051
47	Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions	1046
48	Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3	1045
49	Definitions of Functional Programming	1037
50	From Scala Monadic Effects to Unison Algebraic Effects	1015
51	Applicative Functor - Part 2	1001
52	Nat, List and Option Monoids - From scratch - Combining and Folding - An example	998
53	The Sieve of Eratosthenes - Part 1	997
54	Kleisli Composition	995
55	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3	986
56	Computer Graphics in Java and Scala - Part 1b	974
57	Game of Life - Polyglot FP - Haskell and Scala - Part 1	970
58	Folding Unfolded - Part 1	952
59	Monad Fact #1	946
60	Scala 3 enum for a terser Option Monad Algebraic Data Type	937
61	A sighting of traverse_ in Practical FP in Scala	933
62	Folding Unfolded - Part 2	929
63	Applicative Functor - Part 1	928
64	Monad Fact #4	907
65	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2	896
66	Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms	892
67	Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala	892
68	The Monad Fact Series	884
69	The Debt Metaphor - Ward Cunningham in his 2009 YouTube video	883
70	A sighting of sequence function in Practical FP in Scala	883
71	Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example	879
72	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4	876
73	‘go-to’ general-purpose sequential collections - from Java To Scala	869
74	Sum and Product Types - The Fruit Salad & Fruit Snack Example	869
75	The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell	852
76	A sighting of traverseFilter and foldMap in Practical FP in Scala	851
77	Monad Fact #6	845
78	The Uniform Access Principle	843
79	Arrive at monads by going from composition of pure functions to composition of effectful functions	842
80	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1	839
81	Applicative Functor - Part 3	838
82	Fusing Transformations of Strict Scala Collections with Views	836
83	Function Applicative for Great Good of Palindrome Checker Function	833
84	Folding Unfolded - Part 3	827
85	Functor Laws	825
86	Monad Fact #3	825
87	Folding Unfolded - Part 4	824
88	Monad Fact #5	816
89	Folding Unfolded - Part 5	816
90	The aggregate function - from sequential and parallel folds to parallel aggregation	815
91	Game of Life - Polyglot FP - Haskell and Scala - Part 3	810
92	Monad Fact #2	809
93	Game of Life - Polyglot FP - Haskell and Scala - Part 2	773
94	Functional Effects - Part 1	765
95	Folding Cheat Sheet Series Titles	765
96	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2	752
97	Left and Right Folds - Comparison of a mathematical definition and a programmatic one	751
98	Monoids - Part 1 - With examples using Scalaz and Cats	736
99	Sequence and Traverse - Part 1	732
100	Sequence and Traverse - Part 3	730
101	Functional Effects - Part 2	729
102	Natural Transformations	726
103	State Monad	716
104	Sequence and Traverse - Part 2	709
105	Monoids - Part 2 - With examples using Scalaz and Cats	690
106	Writer Monad for logging execution of functions	676
107	Ad hoc Polymorphism using Type Classes and Cats	674
108	Monads do not Compose	569
109	Function Composition - forward composition versus backward composition	567
110	Functor Composition	557
111	Monad Transformers - Part 1	540
112	Monad as Functor with pair of Natural Transformations	533
113	Addendum to `Monads do not Compose`	528
114	De Morgan's Laws are Monoid Homomorphisms	519
115	Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence	498
116	Year when lambda functions were introduced in various languages	496
117	Non-strict functions, bottom, and Scala by-name parameters	403