116 Decks Ordered By Applause Count - Highest First - Chse one - invert order

#	Title	Applauses
1	Monad Laws Must Be Checked	247
2	N-Queens Combinatorial Puzzle meets Cats	139
3	Direct Style Effect Systems - The Print[A] Example - A Comprehension Aid	127
4	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1	104
5	Definitions of Functional Programming	104
6	The Functional Programming Triad of map, filter and fold	101
7	The Debt Metaphor - Ward Cunningham in his 2009 YouTube video	98
8	Nat, List and Option Monoids - From scratch - Combining and Folding - An example	94
9	The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve	94
10	Scala Left Fold Parallelisation - Three Approaches	94
11	From Scala Monadic Effects to Unison Algebraic Effects	92
12	Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala	85
13	Hand Rolled Applicative User Validation Code Kata	82
14	Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists	82
15	Folding Unfolded - Part 3	81
16	Tagless Final Encoding - Algebras and Interpreters and also Programs	77
17	The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell	77
18	Scala 3 enum for a terser Option Monad Algebraic Data Type	77
19	Computer Graphics in Java and Scala - Part 1b	71
20	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java	71
21	Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3	70
22	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	68
23	From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example	68
24	Compositionality and Category Theory	67
25	A Sighting of filterA in Typelevel Rite of Passage	65
26	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala	65
27	Folding Cheat Sheet #6 - Left and right folds and tail recursion	64
28	Folding Unfolded - Part 2	63
29	Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms	62
30	Function Applicative for Great Good of Leap Year Function	62
31	Applicative Functor - Part 2	61
32	Computer Graphics in Java and Scala - Part 1	61
33	Monad Fact #3	60
34	Game of Life - Polyglot FP - Haskell and Scala - Part 3	60
35	Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold	60
36	Monad Fact #1	59
37	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3	59
38	Monoids - Part 1 - With examples using Scalaz and Cats	58
39	Applicative Functor - Part 1	57
40	Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3	57
41	Game of Life - Polyglot FP - Haskell and Scala - Part 1	57
42	Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java	56
43	Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions	56
44	Folding Unfolded - Part 1	55
45	Sum and Product Types - The Fruit Salad & Fruit Snack Example	55
46	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4	55
47	Functor Laws	54
48	The Uniform Access Principle	54
49	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1	54
50	Folding Cheat Sheet #3 - The universal property of fold	53
51	Folding Unfolded - Part 4	53
52	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2	53
53	Monad Fact #4	53
54	The Monad Fact Series	52
55	Arrive at monads by going from composition of pure functions to composition of effectful functions	52
56	Kleisli Composition	52
57	Monad Fact #6	52
58	State Monad	52
59	Left and Right Folds - Comparison of a mathematical definition and a programmatic one	51
60	Function Applicative for Great Good of Palindrome Checker Function	51
61	The Expression Problem Part 2	50
62	Natural Transformations	50
63	Game of Life - Polyglot FP - Haskell and Scala - Part 2	50
64	Writer Monad for logging execution of functions	50
65	Monad Fact #2	49
66	The Sieve of Eratosthenes - Part 1	49
67	Applicative Functor - Part 3	48
68	A sighting of traverse_ in Practical FP in Scala	48
69	Fusing Transformations of Strict Scala Collections with Views	47
70	Folding Cheat Sheet #8 - Folding with monoids	47
71	Folding Cheat Sheet #7 - The three duality theorems of fold	46
72	The Expression Problem Part 1	46
73	A sighting of traverseFilter and foldMap in Practical FP in Scala	46
74	The aggregate function - from sequential and parallel folds to parallel aggregation	46
75	Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala	46
76	Monad Fact #5	45
77	Monoids - Part 2 - With examples using Scalaz and Cats	45
78	Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example	44
79	Folding Unfolded - Part 5	43
80	Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions	43
81	Folding Cheat Sheet Series Titles	43
82	Functional Effects - Part 2	43
83	Sequence and Traverse - Part 2	42
84	‘go-to’ general-purpose sequential collections - from Java To Scala	42
85	Functional Effects - Part 1	41
86	Ad hoc Polymorphism using Type Classes and Cats	41
87	A sighting of sequence function in Practical FP in Scala	41
88	Sequence and Traverse - Part 3	40
89	Sequence and Traverse - Part 1	40
90	Monad Transformers - Part 1	38
91	Monads do not Compose	37
92	Fibonacci Function Gallery - Part 1	36
93	Fibonacci Function Gallery - Part 2	35
94	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2	35
95	Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	34
96	Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence	33
97	Functor Composition	32
98	Function Composition - forward composition versus backward composition	31
99	The Open-Closed Principle - Part 1 - The Original Version	30
100	Addendum to `Monads do not Compose`	30
101	Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation	30
102	Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity	29
103	Monad as Functor with pair of Natural Transformations	29
104	Year when lambda functions were introduced in various languages	28
105	The Nature of Complexity in John Ousterhout’s Philosophy of Software Design	27
106	List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	27
107	De Morgan's Laws are Monoid Homomorphisms	27
108	The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction	24
109	Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1	23
110	Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication	22
111	Non-strict functions, bottom, and Scala by-name parameters	20
112	Point-free or Die - Tacit Programming in Haskell	19
113	ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names	13
114	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1	12
115	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2	7
116	AI Concepts - MCP Neurons	3