117 Decks - Latest First - Chse one - invert order

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

2  AI Concepts - MCP Neurons

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

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

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

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

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

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

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

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

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

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

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

14  Fibonacci Function Gallery - Part 2

15  Fibonacci Function Gallery - Part 1

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

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

18  Folding Cheat Sheet #8 - Folding with monoids

19  Function Applicative for Great Good of Leap Year Function

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

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

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

23  Hand Rolled Applicative User Validation Code Kata

24  A Sighting of filterA in Typelevel Rite of Passage

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

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

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

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

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

30  Folding Cheat Sheet Series Titles

31  Scala Left Fold Parallelisation - Three Approaches

32  Tagless Final Encoding - Algebras and Interpreters and also Programs

33  Fusing Transformations of Strict Scala Collections with Views

34  A sighting of traverse_ in Practical FP in Scala

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

36  A sighting of sequence function in Practical FP in Scala

37  N-Queens Combinatorial Puzzle meets Cats

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

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

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

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

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

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

44  The Sieve of Eratosthenes - Part 1

45  The Uniform Access Principle

46  Computer Graphics in Java and Scala - Part 1b

47  The Expression Problem Part 2

48  Computer Graphics in Java and Scala - Part 1

49  The Expression Problem Part 1

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

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

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

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

54  The Functional Programming Triad of map, filter and fold

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

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

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

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

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

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

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

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

63  Function Applicative for Great Good of Palindrome Checker Function

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

65  Folding Unfolded - Part 5

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

67  Folding Unfolded - Part 4

68  Folding Unfolded - Part 3

69  Folding Unfolded - Part 2

70  Folding Unfolded - Part 1

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

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

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

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

75  From Scala Monadic Effects to Unison Algebraic Effects

76  Monad Fact #6

77  Monad Fact #5

78  Monad Fact #4

79  Monad Fact #3

80  Monad Fact #2

81  Monad Fact #1

82  The Monad Fact Series

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

84  State Monad

85  Applicative Functor - Part 3

86  Applicative Functor - Part 2

87  Functional Effects - Part 2

88  Functional Effects - Part 1

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

90  Ad hoc Polymorphism using Type Classes and Cats

91  Year when lambda functions were introduced in various languages

92  Function Composition - forward composition versus backward composition

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

94  Addendum to `Monads do not Compose`

95  Monad Transformers - Part 1

96  Monads do not Compose

97  Functor Composition

98  Sequence and Traverse - Part 3

99  Sequence and Traverse - Part 2

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

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

102  Definitions of Functional Programming

103  Sequence and Traverse - Part 1

104  Applicative Functor - Part 1

105  Writer Monad for logging execution of functions

106  Kleisli Composition

107  Monad Laws Must Be Checked

108  Point-free or Die - Tacit Programming in Haskell

109  Monad as Functor with pair of Natural Transformations

110  Natural Transformations

111  Functor Laws

112  Compositionality and Category Theory

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

114  De Morgan's Laws are Monoid Homomorphisms

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

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

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