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

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