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

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