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

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