124 Decks - Latest First - Chse one - invert order

 1 The Bowling Game - From Imperative to Functional Programming - Part 3
slide 1
 2 The Bowling Game - From Imperative to Functional Programming - Part 2
slide 1
 3 The Bowling Game - From Imperative to Functional Programming - Part 1
slide 1
 4 Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to Github Copilot Chat - using Scala in IntelliJ IDEA
slide 1
 5 Imperative Bowling Kata - 20 Years On - Delegating Menial Tasks to AI Coding Tool 'Claude Code'
slide 1
 6 AI Concepts - MCP Neurons
slide 1
 7 Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2
slide 1
 8 Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1
slide 1
 9 Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1
slide 1
 10 ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names
slide 1
 11 Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'
slide 1
 12 List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'
slide 1
 13 Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation
slide 1
 14 The Nature of Complexity in John Ousterhout’s Philosophy of Software Design
slide 1
 15 Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication
slide 1
 16 Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity
slide 1
 17 Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3
slide 1
 18 Fibonacci Function Gallery - Part 2
slide 1
 19 Fibonacci Function Gallery - Part 1
slide 1
 20 The Debt Metaphor - Ward Cunningham in his 2009 YouTube video
slide 1
 21 From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example
slide 1
 22 Folding Cheat Sheet #8 - Folding with monoids
slide 1
 23 Function Applicative for Great Good of Leap Year Function
slide 1
 24 Folding Cheat Sheet #7 - The three duality theorems of fold
slide 1
 25 Folding Cheat Sheet #6 - Left and right folds and tail recursion
slide 1
 26 Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions
slide 1
 27 Hand Rolled Applicative User Validation Code Kata
slide 1
 28 A Sighting of filterA in Typelevel Rite of Passage
slide 1
 29 Direct Style Effect Systems - The Print[A] Example - A Comprehension Aid
slide 1
 30 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
slide 1
 31 Folding Cheat Sheet #3 - The universal property of fold
slide 1
 32 Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold
slide 1
 33 Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists
slide 1
 34 Folding Cheat Sheet Series Titles
slide 1
 35 Scala Left Fold Parallelisation - Three Approaches
slide 1
 36 Tagless Final Encoding - Algebras and Interpreters and also Programs
slide 1
 37 Fusing Transformations of Strict Scala Collections with Views
slide 1
 38 A sighting of traverse_ in Practical FP in Scala
slide 1
 39 A sighting of traverseFilter and foldMap in Practical FP in Scala
slide 1
 40 A sighting of sequence function in Practical FP in Scala
slide 1
 41 N-Queens Combinatorial Puzzle meets Cats
slide 1
 42 Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3
slide 1
 43 The aggregate function - from sequential and parallel folds to parallel aggregation
slide 1
 44 Nat, List and Option Monoids - From scratch - Combining and Folding - An example
slide 1
 45 The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve
slide 1
 46 Sum and Product Types - The Fruit Salad & Fruit Snack Example
slide 1
 47 Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java
slide 1
 48 Defining filter using (a) recursion (b) folding (c) folding with S, B and I combinators (d) folding with applicative functor and identity function
slide 1
 49 The Sieve of Eratosthenes - Part 1
slide 1
 50 The Uniform Access Principle
slide 1
 51 Computer Graphics in Java and Scala - Part 1b
slide 1
 52 The Expression Problem Part 2
slide 1
 53 Computer Graphics in Java and Scala - Part 1
slide 1
 54 The Expression Problem Part 1
slide 1
 55 Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example
slide 1
 56 Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java
slide 1
 57 Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala
slide 1
 58 ‘go-to’ general-purpose sequential collections - from Java To Scala
slide 1
 59 The Functional Programming Triad of map, filter and fold
slide 1
 60 Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala
slide 1
 61 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4
slide 1
 62 Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms
slide 1
 63 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3
slide 1
 64 Left and Right Folds - Comparison of a mathematical definition and a programmatic one
slide 1
 65 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2
slide 1
 66 N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1
slide 1
 67 Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala
slide 1
 68 Function Applicative for Great Good of Palindrome Checker Function
slide 1
 69 Scala 3 enum for a terser Option Monad Algebraic Data Type
slide 1
 70 Folding Unfolded - Part 5
slide 1
 71 The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell
slide 1
 72 Folding Unfolded - Part 4
slide 1
 73 The Functional Programming Triad of fold, scan and iterate
slide 1
 74 Folding Unfolded - Part 3
slide 1
 75 Folding Unfolded - Part 2
slide 1
 76 Folding Unfolded - Part 1
slide 1
 77 Game of Life - Polyglot FP - Haskell and Scala - Part 3
slide 1
 78 Game of Life - Polyglot FP - Haskell and Scala - Part 2
slide 1
 79 Game of Life - Polyglot FP - Haskell and Scala - Part 1
slide 1
 80 Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2
slide 1
 81 From Scala Monadic Effects to Unison Algebraic Effects
slide 1
 82 Monad Fact #6
slide 1
 83 Monad Fact #5
slide 1
 84 Monad Fact #4
slide 1
 85 Monad Fact #3
slide 1
 86 Monad Fact #2
slide 1
 87 Monad Fact #1
slide 1
 88 The Monad Fact Series
slide 1
 89 Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1
slide 1
 90 State Monad
slide 1
 91 Applicative Functor - Part 3
slide 1
 92 Applicative Functor - Part 2
slide 1
 93 Functional Effects - Part 2
slide 1
 94 Functional Effects - Part 1
slide 1
 95 Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence
slide 1
 96 Ad hoc Polymorphism using Type Classes and Cats
slide 1
 97 Year when lambda functions were introduced in various languages
slide 1
 98 Function Composition - forward composition versus backward composition
slide 1
 99 Non-strict functions, bottom, and Scala by-name parameters
slide 1
 100 Addendum to `Monads do not Compose`
slide 1
 101 Monad Transformers - Part 1
slide 1
 102 Monads do not Compose
slide 1
 103 Functor Composition
slide 1
 104 Sequence and Traverse - Part 3
slide 1
 105 Sequence and Traverse - Part 2
slide 1
 106 Monoids - Part 2 - With examples using Scalaz and Cats
slide 1
 107 Monoids - Part 1 - With examples using Scalaz and Cats
slide 1
 108 Definitions of Functional Programming
slide 1
 109 Sequence and Traverse - Part 1
slide 1
 110 Abstracting over Execution with Higher Kinded Types, and how to remain Purely Functional
slide 1
 111 Applicative Functor - Part 1
slide 1
 112 Writer Monad for logging execution of functions
slide 1
 113 Kleisli Composition
slide 1
 114 Monad Laws Must Be Checked
slide 1
 115 Point-free or Die - Tacit Programming in Haskell
slide 1
 116 Monad as Functor with pair of Natural Transformations
slide 1
 117 Natural Transformations
slide 1
 118 Functor Laws
slide 1
 119 Compositionality and Category Theory
slide 1
 120 Arrive at monads by going from composition of pure functions to composition of effectful functions
slide 1
 121 De Morgan's Laws are Monoid Homomorphisms
slide 1
 122 Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions
slide 1
 123 The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction
slide 1
 124 The Open-Closed Principle - Part 1 - The Original Version
slide 1