111 Decks Ordered By Love Count - Highest First - Chse one - invert order

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