112 Decks - Latest First - Chse one - invert order

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

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

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

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

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

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

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

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

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

10  Fibonacci Function Gallery - Part 2

11  Fibonacci Function Gallery - Part 1

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

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

14  Folding Cheat Sheet #8 - Folding with monoids

15  Function Applicative for Great Good of Leap Year Function

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

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

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

19  Hand Rolled Applicative User Validation Code Kata

20  A Sighting of filterA in Typelevel Rite of Passage

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

22  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

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

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

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

26  Folding Cheat Sheet Series Titles

27  Scala Left Fold Parallelisation - Three Approaches

28  Tagless Final Encoding - Algebras and Interpreters and also Programs

29  Fusing Transformations of Strict Scala Collections with Views

30  A sighting of traverse_ in Practical FP in Scala

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

32  A sighting of sequence function in Practical FP in Scala

33  N-Queens Combinatorial Puzzle meets Cats

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

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

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

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

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

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

40  The Sieve of Eratosthenes - Part 1

41  The Uniform Access Principle

42  Computer Graphics in Java and Scala - Part 1b

43  The Expression Problem Part 2

44  Computer Graphics in Java and Scala - Part 1

45  The Expression Problem Part 1

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

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

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

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

50  The Functional Programming Triad of map, filter and fold

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

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

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

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

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

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

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

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

59  Function Applicative for Great Good of Palindrome Checker Function

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

61  Folding Unfolded - Part 5

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

63  Folding Unfolded - Part 4

64  Folding Unfolded - Part 3

65  Folding Unfolded - Part 2

66  Folding Unfolded - Part 1

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

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

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

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

71  From Scala Monadic Effects to Unison Algebraic Effects

72  Monad Fact #6

73  Monad Fact #5

74  Monad Fact #4

75  Monad Fact #3

76  Monad Fact #2

77  Monad Fact #1

78  The Monad Fact Series

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

80  State Monad

81  Applicative Functor - Part 3

82  Applicative Functor - Part 2

83  Functional Effects - Part 2

84  Functional Effects - Part 1

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

86  Ad hoc Polymorphism using Type Classes and Cats

87  Year when lambda functions were introduced in various languages

88  Function Composition - forward composition versus backward composition

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

90  Addendum to `Monads do not Compose`

91  Monad Transformers - Part 1

92  Monads do not Compose

93  Functor Composition

94  Sequence and Traverse - Part 3

95  Sequence and Traverse - Part 2

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

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

98  Definitions of Functional Programming

99  Sequence and Traverse - Part 1

100  Applicative Functor - Part 1

101  Writer Monad for logging execution of functions

102  Kleisli Composition

103  Monad Laws Must Be Checked

104  Monad as Functor with pair of Natural Transformations

105  Natural Transformations

106  Functor Laws

107  Compositionality and Category Theory

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

109  De Morgan's Laws are Monoid Homomorphisms

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

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

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