Monads foo 1 n Method to print a

Monads

foo 1 n Method to print a string, then return its length: n n scala> def foo 1(bar: String) = { | println(bar) | bar. size | } foo 1: (bar: String)Int scala> foo 1("Hello") Hello res 0: Int = 5 2

foo 2 n Here’s the same method, but replacing each expression with an anonymous function: n n scala> def foo 1(bar: String) = { | (() => println(bar))() | (() => bar. length)() | } foo 1: (bar: String)Int scala> foo 2("Hello") Hello res 1: Int = 5 3

and. Then does sequencing n scala> def double(x: Int) = 2 * x double: (x: Int)Int scala> def triple(x: Int) = 3 * x triple: (x: Int)Int scala> ((double _) and. Then (triple _))(5) res 4: Int = 30 n scala> def upper(s: String) = s. to. Upper. Case upper: (s: String)String scala> def add. Xs(s: String) = "x" + s + "x" add. Xs: (s: String)String scala> ((upper _) and. Then (add. Xs _))("Hello") res 10: String = x. HELLOx 4

and. Then applied to foo n Consider this form: n n def foo(bar: String) = { ({ () => println(bar) } and. Then { () => bar. length })() } The above almost works… n n n is not defined for 0 -argument functions Basically, what this achieves is sequencing in a purely functional manner In pure functions, there is no concept of sequencing and. Then 5

Thing n Compare: n def foo(i: Int) = i + 1 val a = 1 val b = foo(a) n With: n case class Thing[+A](value: A) val a = Thing(1) val b = Thing(2) def foo(i: Int) = Thing(i + 1) val a = Thing(1) val b = foo(a. value) n The difference is that in the second, the value is “wrapped” in a Thing container 6

Monads as wrappers n A monad consists of three things: n n A type constructor M A bind operation, (>>=) : : (Monad m) => m a -> (a -> m b) -> m b A return operation, return : : (Monad m) => a -> m a Is Thing a monad? n n n It has a type constructor, Thing It has a return operation, Thing(i) Let’s give it a bind operation: case class Thing[+A](value: A) { def bind[B](f: A => Thing[B]) = f(value) } 7

The Thing monad n Here’s what we had before: n scala> val a = Thing(1) a: Thing[Int] = Thing(1) scala> val b = foo(a. value) b: Thing[Int] = Thing(2) n Here’s what we have now: n scala> val a = Thing(1) a: Thing[Int] = Thing(1) scala> val b = a bind foo b: Thing[Int] = Thing(2) n We have additional syntax, but really, nothing’s changed 8

The monad pattern n n Any time you start with something which you pull apart and use to compute a new something of that same type, you have a monad. val a = Thing(1) n n The first thing is that I can wrap up a value inside of a new Thing. Objectoriented developers might call this a “constructor”. Monads call it “the unit function”. Haskell calls it “return” (maybe we shouldn’t try to figure out that one just yet). a bind { i => Thing(i + 1) } n We also have this fancy bind function, which digs inside our Thing and allows a function which we supply to use that value to create a new Thing. Scala calls this function “flat. Map”. Haskell calls it “>>=”. …What’s interesting here is the fact that bind is how you combine two things together in sequence. Directly quoted from www. codecommit. com/blog/ 9

bind == flat. Map n n Scala’s for expression is translated into map, flat. Map, and with. Filter operations Multiple generators lead to a flat. Map n n for (x <- expr 1; y <- expr 2; seq) yield expr 3 gets translated to expr 1. flat. Map(x => for (y <- expr 2; seq) yield expr 3) Repeated use of flat. Map will change List[List[items]]] into just List[items] 10

flat. Map n The flat. Map method is like Map, but removes one level of nesting from a sequence n n n scala> List(2, 3, 4, 5) map (x => List(x, x * x * x)) res 21: List[Int]] = List(2, 4, 8), List(3, 9, 27), List(4, 16, 64), List(5, 25, 125)) scala> List(2, 3, 4, 5) flat. Map (x => List(x, x * x * x)) res 22: List[Int] = List(2, 4, 8, 3, 9, 27, 4, 16, 64, 5, 25, 125) Used with a sequence of Option, flat. Map effectively reduces Some(x) to x, and entirely deletes None n scala> List(1, -1, 2, 4, -5, 9) flat. Map (root(_)) res 17: List[Double] = List(1. 0, 1. 4142135623730951, 2. 0, 3. 0) 11

Using flat. Map n n scala> for (v <- List(1, 2, 3, -1, 4)) { | val Some(root. Of. V) = root(v) | println(root. Of. V) | } 1. 0 1. 4142135623730951 1. 7320508075688772 scala. Match. Error: None (of class scala. None$) scala> for (v <- List(1, 2, 3, -1, 4) flat. Map (root(_))) println(v) 1. 0 1. 4142135623730951 1. 7320508075688772 2. 0 12

Option n A value of type Option[T] can be either Some[value] or None, where value is of type T n n n scala> def root(x: Double): Option[Double] = | if (x >= 0) Some(math. sqrt(x)) else None root: (x: Double)Option[Double] scala> root(10. 0) res 14: Option[Double] = Some(3. 1622776601683795) scala> root(-5. 0) res 15: Option[Double] = None 13

bind for Option n sealed trait Option[+A] { def bind[B](f: A => Option[B]): Option[B] } case class Some[+A](value: A) extends Option[A] { def bind[B](f: A => Option[B]) = f(value) } case object None extends Option[Nothing] { def bind[B](f: Nothing => Option[B]) = None } 14

A “functional” println n def foo(bar: String, stdout: Vector[String]) = { val stdout 2 = println(bar, stdout) (bar. length, stdout 2) } def println(str: String, stdout: Vector[String]) = stdout + str n n Functional input is trickier—we won’t go there Now let’s do this for everything! 15

Maintaining state n A purely functional language has no notion of “state” (or time, or change…) n n n Everything relevant to a function is in its parameters Therefore, a function that “changes state” must be called recursively with different parameters Consider an adventure game n n n State includes the location of each object and the location of the player—this is easily done with a Map The state usually includes other information (is the dragon alive? )—we can put this in a tuple along with the Map Player’s actions can be implemented with a function that takes a State and computes a new State—that is, a monad 16

Life, the Universe, and Everything n Passing around the entire “state of the universe” in parameters seems excessive, but… n n n Typically a very large proportion of the information is immutable, and need not be part of the state You have to depend on the quality of the implementation of persistent data structures Scala has a specific State monad n I haven’t explored this, but I’ve read that it’s complicated 17

And then there’s the IO monad… n n Haskell’s IO monad is like our earlier “functional” println, only richer and with a better syntax Like all monads, it pulls apart some kind of a thing, and creates a new thing from it n n The weird part is, I/O happens along the way Output doesn’t affect the result Input does affect the result The IO monad (1) achieves sequencing, and (2) isolates the I/O side effects from the rest of the program 18

Formal definition of a monad n A monad consists of three things: n n A type constructor M A bind operation, (>>=) : : (Monad m) => m a -> (a -> m b) -> m b A return operation, return : : (Monad m) => a -> m a And the operations must obey some simple rules: n return x >>= f n n n f x return just sends its result to the next function m >>= return n = = m Returning the result of an action is equivalent to just doing the action do {x <- m 1; y <- m 2; m 3} = do {y <- do {x <- m 1; m 2} m 3} n >>= is associative

The End n Substantial portions of this talk taken from: http: //www. codecommit. com/blog/ 20

Try n scala> import scala. util. {Try, Success, Failure} scala> def root 2(x: Double): Try[Double] = | if (x >= 0) Success(math. sqrt(x)) else | Failure(new Exception("Imaginary root")) root 2: (x: Double)scala. util. Try[Double] n n scala> root 2(10) res 28: scala. util. Try[Double] = Success(3. 1622776601683795) scala> root 2(-10) res 29: scala. util. Try[Double] = Failure(java. lang. Exception: Imaginary root) 21