113 Decks Ordered By View Count - Lowest First - Chse one - invert order

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