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