121 Decks - Latest First - Chse one - invert order

1  The Bowling Game - From Imperative to Functional Programming - Part 1

2  Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to Github Copilot Chat - using Scala in IntelliJ IDEA

3  Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code'

4  AI Concepts - MCP Neurons

5  Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2

6  Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1

7  Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1

8  ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names

9  Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'

10  List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'

11  Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation

12  The Nature of Complexity in John Ousterhout’s Philosophy of Software Design

13  Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication

14  Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity

15  Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3

16  Fibonacci Function Gallery - Part 2

17  Fibonacci Function Gallery - Part 1

18  The Debt Metaphor - Ward Cunningham in his 2009 YouTube video

19  From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example

20  Folding Cheat Sheet #8 - Folding with monoids

21  Function Applicative for Great Good of Leap Year Function

22  Folding Cheat Sheet #7 - The three duality theorems of fold

23  Folding Cheat Sheet #6 - Left and right folds and tail recursion

24  Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions

25  Hand Rolled Applicative User Validation Code Kata

26  A Sighting of filterA in Typelevel Rite of Passage

27  Direct Style Effect Systems - The Print[A] Example - A Comprehension Aid

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

29  Folding Cheat Sheet #3 - The universal property of fold

30  Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold

31  Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists

32  Folding Cheat Sheet Series Titles

33  Scala Left Fold Parallelisation - Three Approaches

34  Tagless Final Encoding - Algebras and Interpreters and also Programs

35  Fusing Transformations of Strict Scala Collections with Views

36  A sighting of traverse_ in Practical FP in Scala

37  A sighting of traverseFilter and foldMap in Practical FP in Scala

38  A sighting of sequence function in Practical FP in Scala

39  N-Queens Combinatorial Puzzle meets Cats

40  Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3

41  The aggregate function - from sequential and parallel folds to parallel aggregation

42  Nat, List and Option Monoids - From scratch - Combining and Folding - An example

43  The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve

44  Sum and Product Types - The Fruit Salad & Fruit Snack Example

45  Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java

46  Defining filter using (a) recursion (b) folding (c) folding with S, B and I combinators (d) folding with applicative functor and identity function

47  The Sieve of Eratosthenes - Part 1

48  The Uniform Access Principle

49  Computer Graphics in Java and Scala - Part 1b

50  The Expression Problem Part 2

51  Computer Graphics in Java and Scala - Part 1

52  The Expression Problem Part 1

53  Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example

54  Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java

55  Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala

56  ‘go-to’ general-purpose sequential collections - from Java To Scala

57  The Functional Programming Triad of map, filter and fold

58  Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala

59  N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4

60  Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms

61  N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3

62  Left and Right Folds - Comparison of a mathematical definition and a programmatic one

63  N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2

64  N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1

65  Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala

66  Function Applicative for Great Good of Palindrome Checker Function

67  Scala 3 enum for a terser Option Monad Algebraic Data Type

68  Folding Unfolded - Part 5

69  The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell

70  Folding Unfolded - Part 4

71  The Functional Programming Triad of fold, scan and iterate

72  Folding Unfolded - Part 3

73  Folding Unfolded - Part 2

74  Folding Unfolded - Part 1

75  Game of Life - Polyglot FP - Haskell and Scala - Part 3

76  Game of Life - Polyglot FP - Haskell and Scala - Part 2

77  Game of Life - Polyglot FP - Haskell and Scala - Part 1

78  Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2

79  From Scala Monadic Effects to Unison Algebraic Effects

80  Monad Fact #6

81  Monad Fact #5

82  Monad Fact #4

83  Monad Fact #3

84  Monad Fact #2

85  Monad Fact #1

86  The Monad Fact Series

87  Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1

88  State Monad

89  Applicative Functor - Part 3

90  Applicative Functor - Part 2

91  Functional Effects - Part 2

92  Functional Effects - Part 1

93  Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence

94  Ad hoc Polymorphism using Type Classes and Cats

95  Year when lambda functions were introduced in various languages

96  Function Composition - forward composition versus backward composition

97  Non-strict functions, bottom, and Scala by-name parameters

98  Addendum to `Monads do not Compose`

99  Monad Transformers - Part 1

100  Monads do not Compose

101  Functor Composition

102  Sequence and Traverse - Part 3

103  Sequence and Traverse - Part 2

104  Monoids - Part 2 - With examples using Scalaz and Cats

105  Monoids - Part 1 - With examples using Scalaz and Cats

106  Definitions of Functional Programming

107  Sequence and Traverse - Part 1

108  Applicative Functor - Part 1

109  Writer Monad for logging execution of functions

110  Kleisli Composition

111  Monad Laws Must Be Checked

112  Point-free or Die - Tacit Programming in Haskell

113  Monad as Functor with pair of Natural Transformations

114  Natural Transformations

115  Functor Laws

116  Compositionality and Category Theory

117  Arrive at monads by going from composition of pure functions to composition of effectful functions

118  De Morgan's Laws are Monoid Homomorphisms

119  Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions

120  The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction

121  The Open-Closed Principle - Part 1 - The Original Version