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