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

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