| Some y -> Some (g x y));;
Then we lift the entire computation into the monad by applying ⇧ to
-the integers, and by applying `map1` to the operators:
+the integers, and by applying `map2` to the operators:
<pre>
\tree ((((map2 +) (⇧1)) (((map2 *) (((map2 /) (⇧6)) (⇧0))) (⇧4))))
(using bind), and the non-intersective adjectives will take
intensional arguments.
-
+notes: cascade, general env