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