111 Decks - Latest First - Chse one - invert order

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