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	8912
2	N-Queens Combinatorial Puzzle meets Cats	3918
3	The Open-Closed Principle - Part 1 - The Original Version	3755
4	Folding Cheat Sheet #6 - Left and right folds and tail recursion	3525
5	Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists	3376
6	Monad Laws Must Be Checked	3103
7	Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions	2813
8	Fibonacci Function Gallery - Part 2	2662
9	List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	2574
10	Folding Cheat Sheet #7 - The three duality theorems of fold	2396
11	The Functional Programming Triad of map, filter and fold	2355
12	Fibonacci Function Gallery - Part 1	2343
13	Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3	2333
14	Function Applicative for Great Good of Leap Year Function	2306
15	Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold	2245
16	Folding Cheat Sheet #3 - The universal property of fold	2239
17	The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction	2067
18	Folding Cheat Sheet #8 - Folding with monoids	2050
19	A Sighting of filterA in Typelevel Rite of Passage	1953
20	Tagless Final Encoding - Algebras and Interpreters and also Programs	1881
21	Point-free or Die - Tacit Programming in Haskell	1838
22	ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names	1825
23	Hand Rolled Applicative User Validation Code Kata	1757
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	1665
25	From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example	1626
26	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1	1605
27	Compositionality and Category Theory	1517
28	Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	1481
29	The Nature of Complexity in John Ousterhout’s Philosophy of Software Design	1430
30	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2	1310
31	Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation	1282
32	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java	1229
33	Scala Left Fold Parallelisation - Three Approaches	1222
34	The Expression Problem Part 1	1195
35	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1	1111
36	AI Concepts - MCP Neurons	1108
37	Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication	1104
38	Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java	1079
39	The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve	1073
40	Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity	1034
41	Computer Graphics in Java and Scala - Part 1	1031
42	Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1	1023
43	Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions	1020
44	Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala	1017
45	Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3	1013
46	Definitions of Functional Programming	1007
47	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala	993
48	The Expression Problem Part 2	983
49	Kleisli Composition	969
50	The Sieve of Eratosthenes - Part 1	964
51	From Scala Monadic Effects to Unison Algebraic Effects	962
52	Nat, List and Option Monoids - From scratch - Combining and Folding - An example	962
53	Applicative Functor - Part 2	953
54	Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code'	947
55	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3	938
56	Computer Graphics in Java and Scala - Part 1b	923
57	Monad Fact #1	920
58	Game of Life - Polyglot FP - Haskell and Scala - Part 1	919
59	A sighting of traverse_ in Practical FP in Scala	905
60	Folding Unfolded - Part 1	902
61	Applicative Functor - Part 1	900
62	Monad Fact #4	884
63	Scala 3 enum for a terser Option Monad Algebraic Data Type	881
64	Folding Unfolded - Part 2	880
65	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2	872
66	Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms	860
67	Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala	856
68	A sighting of sequence function in Practical FP in Scala	855
69	The Debt Metaphor - Ward Cunningham in his 2009 YouTube video	848
70	Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example	844
71	‘go-to’ general-purpose sequential collections - from Java To Scala	842
72	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4	840
73	The Monad Fact Series	839
74	Sum and Product Types - The Fruit Salad & Fruit Snack Example	838
75	A sighting of traverseFilter and foldMap in Practical FP in Scala	830
76	The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell	818
77	The Uniform Access Principle	817
78	Monad Fact #6	817
79	Arrive at monads by going from composition of pure functions to composition of effectful functions	813
80	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1	811
81	Fusing Transformations of Strict Scala Collections with Views	810
82	Functor Laws	802
83	Folding Unfolded - Part 3	801
84	Function Applicative for Great Good of Palindrome Checker Function	801
85	Applicative Functor - Part 3	799
86	Monad Fact #3	797
87	Monad Fact #5	792
88	Folding Unfolded - Part 4	788
89	The aggregate function - from sequential and parallel folds to parallel aggregation	788
90	Monad Fact #2	782
91	Game of Life - Polyglot FP - Haskell and Scala - Part 3	781
92	Folding Unfolded - Part 5	775
93	Game of Life - Polyglot FP - Haskell and Scala - Part 2	742
94	Functional Effects - Part 1	739
95	Folding Cheat Sheet Series Titles	734
96	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2	727
97	Left and Right Folds - Comparison of a mathematical definition and a programmatic one	723
98	Sequence and Traverse - Part 1	704
99	Sequence and Traverse - Part 3	704
100	Functional Effects - Part 2	704
101	Monoids - Part 1 - With examples using Scalaz and Cats	700
102	Natural Transformations	695
103	State Monad	689
104	Sequence and Traverse - Part 2	683
105	Monoids - Part 2 - With examples using Scalaz and Cats	657
106	Writer Monad for logging execution of functions	648
107	Ad hoc Polymorphism using Type Classes and Cats	641
108	Monads do not Compose	540
109	Function Composition - forward composition versus backward composition	539
110	Functor Composition	531
111	Monad Transformers - Part 1	510
112	Addendum to `Monads do not Compose`	504
113	Monad as Functor with pair of Natural Transformations	500
114	De Morgan's Laws are Monoid Homomorphisms	490
115	Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence	472
116	Year when lambda functions were introduced in various languages	460
117	Non-strict functions, bottom, and Scala by-name parameters	380