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

# Title Views  
1 Non-strict functions, bottom, and Scala by-name parameters 542  
2 Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence 628  
3 Year when lambda functions were introduced in various languages 631  
4 De Morgan's Laws are Monoid Homomorphisms 648  
5 Defining filter using (a) recursion (b) folding (c) folding with S, B and I combinators (d) folding with applicative functor and identity function 664  
6 Monad as Functor with pair of Natural Transformations 664  
7 Addendum to `Monads do not Compose` 681  
8 Monad Transformers - Part 1 686  
9 Functor Composition 693  
10 The Functional Programming Triad of fold, scan and iterate 713  
11 Function Composition - forward composition versus backward composition 714  
12 Monads do not Compose 715  
13 Ad hoc Polymorphism using Type Classes and Cats 829  
14 Writer Monad for logging execution of functions 831  
15 Monoids - Part 2 - With examples using Scalaz and Cats 854  
16 Natural Transformations 854  
17 Sequence and Traverse - Part 2 862  
18 State Monad 866  
19 Sequence and Traverse - Part 3 872  
20 Sequence and Traverse - Part 1 876  
21 Functional Effects - Part 2 886  
22 Monoids - Part 1 - With examples using Scalaz and Cats 887  
23 Left and Right Folds - Comparison of a mathematical definition and a programmatic one 888  
24 Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2 897  
25 Functional Effects - Part 1 915  
26 Game of Life - Polyglot FP - Haskell and Scala - Part 2 916  
27 Monad Fact #2 934  
28 Game of Life - Polyglot FP - Haskell and Scala - Part 3 936  
29 Folding Cheat Sheet Series Titles 936  
30 The aggregate function - from sequential and parallel folds to parallel aggregation 949  
31 Fusing Transformations of Strict Scala Collections with Views 956  
32 Monad Fact #6 956  
33 Folding Unfolded - Part 4 960  
34 Monad Fact #5 962  
35 Function Applicative for Great Good of Palindrome Checker Function 964  
36 Monad Fact #3 967  
37 Functor Laws 974  
38 Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1 980  
39 Arrive at monads by going from composition of pure functions to composition of effectful functions 985  
40 Folding Unfolded - Part 3 992  
41 Applicative Functor - Part 3 993  
42 ‘go-to’ general-purpose sequential collections - from Java To Scala 995  
43 A sighting of traverseFilter and foldMap in Practical FP in Scala 1000  
44 Folding Unfolded - Part 5 1000  
45 The Uniform Access Principle 1001  
46 Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example 1007  
47 Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms 1010  
48 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4 1014  
49 A sighting of sequence function in Practical FP in Scala 1021  
50 Sum and Product Types - The Fruit Salad & Fruit Snack Example 1029  
51 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2 1032  
52 Monad Fact #4 1046  
53 The Debt Metaphor - Ward Cunningham in his 2009 YouTube video 1049  
54 Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to Github Copilot Chat - using Scala in IntelliJ IDEA 1054  
55 The Monad Fact Series 1057  
56 A sighting of traverse_ in Practical FP in Scala 1066  
57 Monad Fact #1 1072  
58 Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala 1081  
59 Applicative Functor - Part 1 1104  
60 Folding Unfolded - Part 2 1111  
61 Folding Unfolded - Part 1 1132  
62 Kleisli Composition 1143  
63 The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell 1145  
64 The Sieve of Eratosthenes - Part 1 1151  
65 Nat, List and Option Monoids - From scratch - Combining and Folding - An example 1170  
66 Computer Graphics in Java and Scala - Part 1b 1181  
67 Game of Life - Polyglot FP - Haskell and Scala - Part 1 1181  
68 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3 1188  
69 Definitions of Functional Programming 1192  
70 Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3 1194  
71 Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions 1201  
72 Applicative Functor - Part 2 1206  
73 Scala 3 enum for a terser Option Monad Algebraic Data Type 1220  
74 Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala 1225  
75 From Scala Monadic Effects to Unison Algebraic Effects 1241  
76 Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity 1256  
77 Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1 1263  
78 The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve 1268  
79 Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala 1282  
80 Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java 1302  
81 Computer Graphics in Java and Scala - Part 1 1316  
82 Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication 1324  
83 The Expression Problem Part 1 1356  
84 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1 1361  
85 Scala Left Fold Parallelisation - Three Approaches 1422  
86 Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code' 1425  
87 AI Concepts - MCP Neurons 1456  
88 Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation 1524  
89 Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java 1556  
90 Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2 1572  
91 The Nature of Complexity in John Ousterhout’s Philosophy of Software Design 1643  
92 The Expression Problem Part 2 1647  
93 Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate' 1669  
94 Compositionality and Category Theory 1705  
95 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 1850  
96 From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example 1864  
97 Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1 2010  
98 Hand Rolled Applicative User Validation Code Kata 2018  
99 Point-free or Die - Tacit Programming in Haskell 2061  
100 ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names 2111  
101 A Sighting of filterA in Typelevel Rite of Passage 2138  
102 Tagless Final Encoding - Algebras and Interpreters and also Programs 2180  
103 Folding Cheat Sheet #8 - Folding with monoids 2241  
104 The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction 2296  
105 Folding Cheat Sheet #3 - The universal property of fold 2440  
106 Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold 2467  
107 Fibonacci Function Gallery - Part 1 2562  
108 Function Applicative for Great Good of Leap Year Function 2565  
109 Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3 2576  
110 The Functional Programming Triad of map, filter and fold 2609  
111 Folding Cheat Sheet #7 - The three duality theorems of fold 2668  
112 List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate' 2836  
113 Fibonacci Function Gallery - Part 2 2894  
114 Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions 3550  
115 Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists 3600  
116 Monad Laws Must Be Checked 3836  
117 Folding Cheat Sheet #6 - Left and right folds and tail recursion 4453  
118 The Open-Closed Principle - Part 1 - The Original Version 4557  
119 N-Queens Combinatorial Puzzle meets Cats 4757  
120 Direct Style Effect Systems - The Print[A] Example - A Comprehension Aid 10186