From d9bf1d89baaef4a0ceeb5c84db4d2a7172aaf400 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Wed, 1 Dec 2010 02:02:47 -0500 Subject: [PATCH] lists-monad tweaks Signed-off-by: Jim Pryor --- list_monad_as_continuation_monad.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/list_monad_as_continuation_monad.mdwn b/list_monad_as_continuation_monad.mdwn index 200b4b0a..7a57ea7b 100644 --- a/list_monad_as_continuation_monad.mdwn +++ b/list_monad_as_continuation_monad.mdwn @@ -276,7 +276,7 @@ So if, for example, we let `k` be `+` and `z` be `0`, then the computation would right-fold + and 2+4+2+4+8+0 over [2] = 2+(2+4+(2+4+8+(0))) ==> right-fold + and 2+2+4+2+4+8+0 over [] = 2+(2+4+(2+4+8+(0))) -which indeed is the result of right-folding + and 0 over `[2; 2; 4; 2; 4; 8]`. If you trace through how this works, you should be able to persuade yourself that our formula: +which indeed is the result of right-folding `+` and `0` over `[2; 2; 4; 2; 4; 8]`. If you trace through how this works, you should be able to persuade yourself that our formula: fun k z -> u (fun a b -> f a k b) z -- 2.11.0