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