website: posts: Fix typos in Dissecting Guix, Part 2: The Store Monad.

* website/posts/dissecting-guix-2-store-monad.md: Fix typos.

Signed-off-by: Ludovic Courtès <ludo@gnu.org>
This commit is contained in:
Wolf 2023-04-30 18:22:17 +02:00 committed by Ludovic Courtès
parent f29f41053b
commit 14c3079247
No known key found for this signature in database
GPG Key ID: 090B11993D9AEBB5
1 changed files with 6 additions and 6 deletions

View File

@ -169,8 +169,8 @@ First of all, we'll revert to our original definitions of `remove-a` and
(nothing)))
```
What if tried introducing higher-order procedures (procedures that accept other
procedures as arguments) into the equation? Because we're functional
What if we tried introducing higher-order procedures (procedures that accept
other procedures as arguments) into the equation? Because we're functional
programmers and we have an unhealthy obsession with that sort of thing.
```scheme
@ -320,8 +320,8 @@ expressions to symbols, and are essentially equivalent to a chain of
;; This is equivalent...
(mlet* %maybe-monad ((str -> "abad") ;non-monadic binding uses the -> symbol
(str1 (remove-a str))
(str2 (remove-b str)))
(remove-a str))
(str2 (remove-b str1)))
(remove-a str2))
⇒ #<<maybe> is?: #t value: "d">
;; ...to this:
@ -330,9 +330,9 @@ expressions to symbols, and are essentially equivalent to a chain of
(lambda (str)
(remove-a str))
(lambda (str1)
(remove-b str))
(remove-b str1))
(lambda (str2)
(remove-a str))))
(remove-a str2))))
```
Various abstractions over these two exist too, such as `mwhen` (a `when` plus an