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

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