123 Decks - Latest First - Chse one - invert order

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