116 Decks - Latest First - Chse one - invert order

1  AI Concepts - MCP Neurons

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

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

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

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

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

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

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

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

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

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

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

13  Fibonacci Function Gallery - Part 2

14  Fibonacci Function Gallery - Part 1

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

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

17  Folding Cheat Sheet #8 - Folding with monoids

18  Function Applicative for Great Good of Leap Year Function

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

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

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

22  Hand Rolled Applicative User Validation Code Kata

23  A Sighting of filterA in Typelevel Rite of Passage

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

25  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

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

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

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

29  Folding Cheat Sheet Series Titles

30  Scala Left Fold Parallelisation - Three Approaches

31  Tagless Final Encoding - Algebras and Interpreters and also Programs

32  Fusing Transformations of Strict Scala Collections with Views

33  A sighting of traverse_ in Practical FP in Scala

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

35  A sighting of sequence function in Practical FP in Scala

36  N-Queens Combinatorial Puzzle meets Cats

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

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

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

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

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

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

43  The Sieve of Eratosthenes - Part 1

44  The Uniform Access Principle

45  Computer Graphics in Java and Scala - Part 1b

46  The Expression Problem Part 2

47  Computer Graphics in Java and Scala - Part 1

48  The Expression Problem Part 1

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

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

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

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

53  The Functional Programming Triad of map, filter and fold

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

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

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

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

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

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

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

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

62  Function Applicative for Great Good of Palindrome Checker Function

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

64  Folding Unfolded - Part 5

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

66  Folding Unfolded - Part 4

67  Folding Unfolded - Part 3

68  Folding Unfolded - Part 2

69  Folding Unfolded - Part 1

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

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

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

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

74  From Scala Monadic Effects to Unison Algebraic Effects

75  Monad Fact #6

76  Monad Fact #5

77  Monad Fact #4

78  Monad Fact #3

79  Monad Fact #2

80  Monad Fact #1

81  The Monad Fact Series

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

83  State Monad

84  Applicative Functor - Part 3

85  Applicative Functor - Part 2

86  Functional Effects - Part 2

87  Functional Effects - Part 1

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

89  Ad hoc Polymorphism using Type Classes and Cats

90  Year when lambda functions were introduced in various languages

91  Function Composition - forward composition versus backward composition

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

93  Addendum to `Monads do not Compose`

94  Monad Transformers - Part 1

95  Monads do not Compose

96  Functor Composition

97  Sequence and Traverse - Part 3

98  Sequence and Traverse - Part 2

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

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

101  Definitions of Functional Programming

102  Sequence and Traverse - Part 1

103  Applicative Functor - Part 1

104  Writer Monad for logging execution of functions

105  Kleisli Composition

106  Monad Laws Must Be Checked

107  Point-free or Die - Tacit Programming in Haskell

108  Monad as Functor with pair of Natural Transformations

109  Natural Transformations

110  Functor Laws

111  Compositionality and Category Theory

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

113  De Morgan's Laws are Monoid Homomorphisms

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

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

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