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

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