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

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