116 Decks Ordered By Love Count - Lowest First - Chse one - invert order

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