116 Decks Ordered By View Count - Highest First - Chse one - invert order

#	Title	Views
1	Direct Style Effect Systems - The Print[A] Example - A Comprehension Aid	8568
2	N-Queens Combinatorial Puzzle meets Cats	3745
3	The Open-Closed Principle - Part 1 - The Original Version	3573
4	Folding Cheat Sheet #6 - Left and right folds and tail recursion	3348
5	Folding Cheat Sheet #1 - Folding over recursively defined data structures for natural numbers and lists	3333
6	Monad Laws Must Be Checked	2933
7	Lambda Expressions and Java 8 - Lambda Calculus, Lambda Expressions, Syntactic Sugar, First Class Functions	2659
8	Fibonacci Function Gallery - Part 2	2609
9	List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	2510
10	Folding Cheat Sheet #7 - The three duality theorems of fold	2350
11	Fibonacci Function Gallery - Part 1	2307
12	The Functional Programming Triad of map, filter and fold	2300
13	Function Applicative for Great Good of Leap Year Function	2263
14	Drawing Heighway’s Dragon - Part 1 - Recursive Function Rewrite - From Imperative Style in Pascal 64 To Functional Style in Scala 3	2254
15	Folding Cheat Sheet #2 - Programmatic and mathematical definitions of right fold and left fold	2209
16	Folding Cheat Sheet #3 - The universal property of fold	2208
17	The Open-Closed Principle - Part 2 - The Contemporary Version - An Introduction	2012
18	Folding Cheat Sheet #8 - Folding with monoids	2011
19	A Sighting of filterA in Typelevel Rite of Passage	1915
20	Tagless Final Encoding - Algebras and Interpreters and also Programs	1812
21	Point-free or Die - Tacit Programming in Haskell	1788
22	ApplicativeError functions handling and recovering from errors: A mnemonic to recall their signatures from their names	1761
23	Hand Rolled Applicative User Validation Code Kata	1712
24	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	1634
25	From Subtype Polymorphism To Typeclass-based Ad hoc Polymorphism - An Example	1598
26	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 1	1503
27	Compositionality and Category Theory	1489
28	Folding Cheat Sheet #9 - List Unfolding - 'unfold' as the Computational Dual of 'fold', and how 'unfold' relates to 'iterate'	1432
29	The Nature of Complexity in John Ousterhout’s Philosophy of Software Design	1393
30	Combinatorial Interview Problems with Backtracking Solutions - from Procedural to Functional Programming - Part 2	1226
31	Drawing Heighway’s Dragon - Part 4 - Interactive and Animated Dragon Creation	1225
32	Scala Left Fold Parallelisation - Three Approaches	1183
33	The Expression Problem Part 1	1158
34	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Java	1156
35	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 1	1068
36	Drawing Heighway’s Dragon - Part 3 - Simplification Through Separation of Concerns - Rotation Without Matrix Multiplication	1060
37	Algebraic Data Types for Data Oriented Programming - From Haskell and Scala to Java	1038
38	The Sieve of Eratosthenes - Part 2 - Genuine versus Unfaithful Sieve	1016
39	Computer Graphics in Java and Scala - Part 1	989
40	Folding Cheat Sheet #5 - Folding a list right and left using Cons and Nil results in the identity and reverse functions	987
41	Drawing Heighway’s Dragon - Part 2 - Recursive Function Simplification - From 2^n Recursive Invocations To n Tail-Recursive Invocations Exploiting Self-Similarity	979
42	Kleisli composition, flatMap, join, map, unit - implementation and interrelation - V2 updated for Scala 3	976
43	Functional Core and Imperative Shell - Game of Life Example - Haskell and Scala	973
44	Definitions of Functional Programming	973
45	Test Doubles - Terminology, Definitions and Illustrations - with Examples - Part 1	967
46	AI Concepts - MCP Neurons	954
47	Refactoring: A First Example - Martin Fowler’s First Example of Refactoring, Adapted to Scala	944
48	The Expression Problem Part 2	939
49	Kleisli Composition	932
50	Nat, List and Option Monoids - From scratch - Combining and Folding - An example	927
51	From Scala Monadic Effects to Unison Algebraic Effects	922
52	The Sieve of Eratosthenes - Part 1	918
53	Applicative Functor - Part 2	914
54	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 3	900
55	Monad Fact #1	882
56	Game of Life - Polyglot FP - Haskell and Scala - Part 1	879
57	Computer Graphics in Java and Scala - Part 1b	874
58	Applicative Functor - Part 1	868
59	Folding Unfolded - Part 1	864
60	A sighting of traverse_ in Practical FP in Scala	862
61	Monad Fact #4	857
62	Scala 3 enum for a terser Option Monad Algebraic Data Type	843
63	Folding Unfolded - Part 2	842
64	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 2	839
65	Quicksort - a whistle-stop tour of the algorithm in five languages and four paradigms	827
66	Sierpinski Triangle - Polyglot FP for Fun and Profit - Haskell and Scala	825
67	A sighting of sequence function in Practical FP in Scala	822
68	‘go-to’ general-purpose sequential collections - from Java To Scala	816
69	The Debt Metaphor - Ward Cunningham in his 2009 YouTube video	814
70	Side by Side - Scala and Java Adaptations of Martin Fowler’s Javascript Refactoring Example	812
71	The Monad Fact Series	809
72	N-Queens Combinatorial Problem - Polyglot FP for Fun and Profit – Haskell and Scala - Part 4	808
73	Sum and Product Types - The Fruit Salad & Fruit Snack Example	801
74	A sighting of traverseFilter and foldMap in Practical FP in Scala	792
75	The Uniform Access Principle	784
76	Monad Fact #6	784
77	The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell	780
78	Arrive at monads by going from composition of pure functions to composition of effectful functions	780
79	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 1	779
80	Fusing Transformations of Strict Scala Collections with Views	779
81	Function Applicative for Great Good of Palindrome Checker Function	774
82	Functor Laws	773
83	Monad Fact #3	769
84	Applicative Functor - Part 3	765
85	Folding Unfolded - Part 3	763
86	Folding Unfolded - Part 4	759
87	Monad Fact #5	759
88	The aggregate function - from sequential and parallel folds to parallel aggregation	759
89	Game of Life - Polyglot FP - Haskell and Scala - Part 3	750
90	Folding Unfolded - Part 5	747
91	Monad Fact #2	746
92	Functional Effects - Part 1	712
93	Game of Life - Polyglot FP - Haskell and Scala - Part 2	709
94	Scala 3 by Example - Algebraic Data Types for Domain Driven Design - Part 2	699
95	Left and Right Folds - Comparison of a mathematical definition and a programmatic one	698
96	Folding Cheat Sheet Series Titles	691
97	Functional Effects - Part 2	673
98	Monoids - Part 1 - With examples using Scalaz and Cats	673
99	Sequence and Traverse - Part 3	671
100	Sequence and Traverse - Part 1	670
101	Natural Transformations	659
102	State Monad	651
103	Sequence and Traverse - Part 2	648
104	Monoids - Part 2 - With examples using Scalaz and Cats	626
105	Writer Monad for logging execution of functions	617
106	Ad hoc Polymorphism using Type Classes and Cats	610
107	Monads do not Compose	505
108	Function Composition - forward composition versus backward composition	503
109	Functor Composition	498
110	Monad Transformers - Part 1	478
111	Addendum to `Monads do not Compose`	472
112	Monad as Functor with pair of Natural Transformations	471
113	De Morgan's Laws are Monoid Homomorphisms	460
114	Symmetry in the interrelation of flatMap/foldMap/traverse and flatten/fold/sequence	442
115	Year when lambda functions were introduced in various languages	429
116	Non-strict functions, bottom, and Scala by-name parameters	347