From: Chris Barker Date: Mon, 8 Nov 2010 02:31:01 +0000 (-0500) Subject: Jacobson as a monad X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=adaf5a4a914b56ca7be6c3fce6da8269e1ed23ca;ds=sidebyside Jacobson as a monad --- diff --git a/week8.mdwn b/week8.mdwn index 1a0b55bb..e99e223a 100644 --- a/week8.mdwn +++ b/week8.mdwn @@ -15,12 +15,12 @@ most one assignment. Jacobson's system contains two main combinators, *g* and *z*. She calls *g* the Geach rule, and *z* effects binding. (There is a third -combinator, *l*, which adjusts function/argument order when the -argument precedes its functor, but we'll finesse that here by freely -reordering the English predicates so that functors always precede -their arguments.) Here is a typical computation (based closely on -email from Simon Charlow, with beta reduction as performed by the -on-line evaluator): +combinator, *l*, which we'll make use of to adjust function/argument +order to better match English word order; N.B., though, that +Jacobson's name for this combinator is "lift", but it is different +from the monadic lift discussed in some detail below.) Here is a +typical computation (based closely on email from Simon Charlow, with +beta reduction as performed by the on-line evaluator): 
 ; Analysis of "Everyone_i thinks he_i left"