X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;f=exercises%2Fassignment7.mdwn;h=3d216293173ce058fb420dfbed719d2a24d0df89;hb=31384d641cc4de93032132ae1b2756a03f2ff387;hp=22152fe3cb044c7e4bedebddaedfb5276741c563;hpb=dbac2255c48ea7f08f9f7f53b2f78d4f17f56a33;p=lambda.git diff --git a/exercises/assignment7.mdwn b/exercises/assignment7.mdwn index 22152fe3..3d216293 100644 --- a/exercises/assignment7.mdwn +++ b/exercises/assignment7.mdwn @@ -76,7 +76,7 @@ as a function from a type to a type. Call this type function M, and let P, Q, R, Recall that a monad requires a singleton function `mid : P-> MP`, and a composition operator `>=> : (P->MQ) -> (Q->MR) -> (P->MR)`. The type for the composition operator stated here corrects a typo in the class handout. -Also, in the handout we called `mid` 1. But now we've decided that `mid` +Also, in the handout we called `mid` `𝟭`. But now we've decided that `mid` is better. (Think of it as "m" plus "identity", not as the start of "midway".) We will also move freely back and forth between using `>=>` and using `<=<` (aka `mcomp`), which