From 4b6eac4476f3b44595dec71f0ad0dea2fa7abee6 Mon Sep 17 00:00:00 2001
From: Marshall Lochbaum <mwlochbaum@gmail.com>
Date: Sun, 7 Jun 2020 15:33:24 -0400
Subject: Use modify in structural Under definition

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index da15b086..89f97daf 100644
--- a/README.md
+++ b/README.md
@@ -139,7 +139,7 @@ Glyph | Name(s)     | Definition                     | Description
 `○`   | Over        | `{(𝔾𝕨)𝔽𝔾𝕩}`                    | Apply `𝔾` to each argument and `𝔽` to the results
 `⊸`   | Before/Bind | `{(𝔽𝕨)𝔾𝕩}˜˜`                   | `𝔾`'s left argument comes from `𝔽`
 `⟜`   | After/Bind  | `{𝕨𝔽𝔾𝕩}˜˜`                     | `𝔽`'s right argument comes from `𝔾`
-`⌾`   | Under       | `{𝔾⁼∘𝔽○𝔾}` OR `{(𝔾𝕩)←𝕨𝔽○𝔾𝕩⋄𝕩}` | Apply `𝔽` over `𝔾`, then undo `𝔾`
+`⌾`   | Under       | `{𝔾⁼∘𝔽○𝔾}` OR `{(𝔾𝕩)↩𝕨𝔽○𝔾𝕩⋄𝕩}` | Apply `𝔽` over `𝔾`, then undo `𝔾`
 
 Under is not a true combinator since it has an "undo" step at the end. This step might be implemented using the left operand's inverse (*computational* Under) or its structural properties (*structural* Under).
 
-- 
cgit v1.2.3