herding cats

day 0
1. What is polymorphism?
2. sum function
3. FoldLeft
4. Method injection (enrich my library)
day 1
1. sbt
2. Eq
3. Order
4. PartialOrder
5. Show
6. Read
7. Enum
8. Numeric
9. typeclasses 102
day 2
1. Making our own typeclass with simulacrum
2. Functor
3. Checking laws with Discipline
4. Import guide
day 3
1. Kinds and some type-foo
2. Semigroupal
3. Apply
4. Applicative
day 4
1. Semigroup
2. Monoid
3. About Laws
4. Using monoids to fold data structures
day 5
1. FlatMap
2. Monad
3. List datatype
4. FunctorFilter
5. A knight’s quest
day 6
1. do vs for
2. Writer datatype
3. Reader datatype
day 7
1. State datatype
2. Validated datatype
3. Ior datatype
day 8
1. Free monoids
2. Free monads
3. Stackless Scala with Free Monads
4. Tail Recursive Monads (FlatMap)
day 9
1. Some useful monadic functions
2. Making a safe RPN calculator
3. Composing monadic functions
4. Making monads
5. Monads are fractals
day 10
1. Monad transformers
2. Stacking Future and Either
day 11
1. Genericity
2. Datatype-generic programming with Bifunctor
3. Const datatype
4. Combining applicative functors
day 12
1. Traverse
2. TraverseFilter
3. Coercing type inference using partial unification
4. Shape and contents
5. Applicative wordcount
day 13
1. Id datatype
2. Eval datatype
3. The Abstract Future
day 14
1. SemigroupK
2. MonoidK
3. Alternative
day 15
1. Basic category theory
2. Arrow
3. Isomorphism
day 16
1. Sets
2. Pos
3. Finite categories
4. Cat
5. Monoid as categories
6. Grp
day 17
1. Initial and terminal objects
2. Product
3. Duality
4. Coproduct
day 18
1. Effect system
2. IO datatype
3. ApplicativeError
4. MonadCancel
day 19
1. FunctionK
2. Resource datatype
3. Ref as monad transformer
Contents in Depth
Combined Pages

day 11

On day 10 we looked at the idea of monad transformers, first using Kliesli as ReaderT, and also stacking Future and Either.

❧

Next page
Genericity

English
日本語