118 Decks - Latest First - Chse one - invert order

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

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

3  AI Concepts - MCP Neurons

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

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

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

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

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

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

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

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

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

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

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

15  Fibonacci Function Gallery - Part 2

16  Fibonacci Function Gallery - Part 1

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

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

19  Folding Cheat Sheet #8 - Folding with monoids

20  Function Applicative for Great Good of Leap Year Function

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

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

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

24  Hand Rolled Applicative User Validation Code Kata

25  A Sighting of filterA in Typelevel Rite of Passage

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

27  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

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

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

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

31  Folding Cheat Sheet Series Titles

32  Scala Left Fold Parallelisation - Three Approaches

33  Tagless Final Encoding - Algebras and Interpreters and also Programs

34  Fusing Transformations of Strict Scala Collections with Views

35  A sighting of traverse_ in Practical FP in Scala

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

37  A sighting of sequence function in Practical FP in Scala

38  N-Queens Combinatorial Puzzle meets Cats

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

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

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

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

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

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

45  The Sieve of Eratosthenes - Part 1

46  The Uniform Access Principle

47  Computer Graphics in Java and Scala - Part 1b

48  The Expression Problem Part 2

49  Computer Graphics in Java and Scala - Part 1

50  The Expression Problem Part 1

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

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

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

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

55  The Functional Programming Triad of map, filter and fold

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

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

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

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

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

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

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

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

64  Function Applicative for Great Good of Palindrome Checker Function

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

66  Folding Unfolded - Part 5

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

68  Folding Unfolded - Part 4

69  Folding Unfolded - Part 3

70  Folding Unfolded - Part 2

71  Folding Unfolded - Part 1

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

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

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

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

76  From Scala Monadic Effects to Unison Algebraic Effects

77  Monad Fact #6

78  Monad Fact #5

79  Monad Fact #4

80  Monad Fact #3

81  Monad Fact #2

82  Monad Fact #1

83  The Monad Fact Series

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

85  State Monad

86  Applicative Functor - Part 3

87  Applicative Functor - Part 2

88  Functional Effects - Part 2

89  Functional Effects - Part 1

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

91  Ad hoc Polymorphism using Type Classes and Cats

92  Year when lambda functions were introduced in various languages

93  Function Composition - forward composition versus backward composition

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

95  Addendum to `Monads do not Compose`

96  Monad Transformers - Part 1

97  Monads do not Compose

98  Functor Composition

99  Sequence and Traverse - Part 3

100  Sequence and Traverse - Part 2

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

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

103  Definitions of Functional Programming

104  Sequence and Traverse - Part 1

105  Applicative Functor - Part 1

106  Writer Monad for logging execution of functions

107  Kleisli Composition

108  Monad Laws Must Be Checked

109  Point-free or Die - Tacit Programming in Haskell

110  Monad as Functor with pair of Natural Transformations

111  Natural Transformations

112  Functor Laws

113  Compositionality and Category Theory

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

115  De Morgan's Laws are Monoid Homomorphisms

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

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

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