learning Scalaz

day 4

Yesterday we reviewed kinds and types, explored Tagged type, and started looking at Semigroup and Monoid as a way of abstracting binary operations over various types.

Next Page ❧ Functor Laws

English
日本語

learning Scalaz

day 0
1. What is polymorphism?
2. sum function
3. FoldLeft
4. Method injection (enrich my library)
day 1
1. sbt
2. Equal
3. Order
4. Show
5. Read
6. Enum
7. Bounded
8. Num
9. typeclasses 102
10. a Yes-No typeclass
day 2
1. Functor
2. Applicative
day 3
1. Kinds and some type-foo
2. Tagged type
3. About those Monoids
day 4
1. Functor Laws
2. Option as Monoid
3. Foldable
day 5
1. A fist full of Monads
2. Walk the line
3. List Monad
4. MonadPlus and the guard function
5. A knight’s quest
6. Monad laws
day 6
1. Writer? I hardly knew her!
2. Reader
day 7
1. Applicative Builder
2. Tasteful stateful computations
3. \/
4. Validation
day 8
1. Some useful monadic functions
2. Making a safe RPN calculator
3. Composing monadic functions
4. Making monads
day 9
1. Tree
2. Zipper
3. Id
4. Lawless typeclasses
day 10
1. Monad transformers
day 11
1. Lens
day 12
1. Origami programming
2. The Essence of the Iterator Pattern
day 13 (import guide)
day 14
day 15
1. Arrow
2. Unapply
3. parallel composition
day 16
1. Memo
2. functional programming
3. Effect system
day 17
1. IO Monad
2. Enumeration-Based I/O with Iteratees
day 18
1. Func
2. Free Monad
3. Stackless Scala with Free Monads
day 19
1. Category theory
2. Point
3. Isomorphisms
4. Determination and choice
day 20
1. Examples of categories
2. Initial and terminal objects
3. Products
4. Duality
day 21
1. Coproducts
2. Hom-sets
3. Natural Transformation
Thanks for reading
Scalaz cheatsheet
Contents in Depth
Combined Pages

day 4

Contents