-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):