From 2528ec5e75daa358162619cc3a704e6bdf88a2c8 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Thu, 14 Apr 2022 21:45:05 -0400 Subject: Documentation for Valences --- doc/primitive.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'doc/primitive.md') diff --git a/doc/primitive.md b/doc/primitive.md index c358d80a..b1253e3c 100644 --- a/doc/primitive.md +++ b/doc/primitive.md @@ -74,7 +74,7 @@ Glyph | Name(s) | Definition | Description `⊸` | Before/Bind | `{(π”½π•¨βŠ£π•©)𝔾𝕩}` | `𝔾`'s left argument comes from `𝔽` `⟜` | After/Bind | `{(π•¨βŠ£π•©)𝔽𝔾𝕩}` | `𝔽`'s right argument comes from `𝔾` `⌾` | Under | `{π”ΎβΌβˆ˜π”½β—‹π”Ύ}` OR `{(𝔾𝕩)↩𝕨𝔽○𝔾𝕩⋄𝕩}` | Apply `𝔽` over `𝔾`, then undo `𝔾` -`⊘` | Valences | `{𝔽𝕩;𝕨𝔾𝕩}` | Apply `𝔽` if there's one argument but `𝔾` if there are two +`⊘` | [Valences](valences.md) | `{𝔽𝕩;𝕨𝔾𝕩}` | Apply `𝔽` if there's one argument but `𝔾` if there are two `β—Ά` | Choose | `{f←(𝕨𝔽𝕩)βŠ‘π•˜ β‹„ 𝕨F𝕩}` | Select one of the functions in list `π•˜` based on `𝔽` Choose isn't really a combinator since it calls the function `βŠ‘`, and 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