Add Conor's Golden Eagle coinage

2 files changed, 16 insertions, 13 deletions

diff --git a/doc/birds.md b/doc/birds.md
index 75498625..55ee37b6 100644
--- a/doc/birds.md
+++ b/doc/birds.md
@@ -4,18 +4,20 @@
 
 Some people consider it reasonable to name [combinators](primitive.md#modifiers) after types of birds. [Here's](https://www.angelfire.com/tx4/cus/combinator/birds.html) one compendium of such names, albeit still missing the Phoenix or `S'` combinator `labcd.a(bd)(cd)` ([this one](https://hackage.haskell.org/package/data-aviary-0.4.0/docs/Data-Aviary-Birds.html) has more). There is something wrong with these people. Some of these birds are not even real. "Quixotic bird"? Have you not heard of a quail? Nonetheless, I don't judge such afflicted souls (certainly not publicly), and have provided this translation table to explain BQN in terms they can understand.
 
-| BQN     | Bird      |  1    | Bird        |  2
-|:-------:|-----------|-------|-------------|---------
-| `⊣`     | Identity  | `I`   | Kestrel     | `K`
-| `⊢`     | Identity  | `I`   |             | `KI`
-| `∘`     | Bluebird  | `B`   | Blackbird   | `B₁`
-| `○`     | Bluebird  | `B`   | Psi?        | `D₂`-like: `labcd.a(bc)(bd)`
-| `˙`     | Kestrel   | `K`   |             | `KK`
-| `⊸`     |           | `R*S` | Queer       | `Q`
-| `⟜`     | Starling  | `S`   | ~Dove       | `D`-like: `labcd.ac(bd)`
-| `˜`     | Warbler   | `W`   | Cardinal    | `C`
-| `k G H` | Dove      | `D`   | Eagle       | `E`
-| `F G H` | Phoenix   | `S'`  | ~Bald Eagle | `Ê`-like: `labcde.a(bde)(cde)`
+| BQN     | Bird      |  1    | Bird         |  2
+|:-------:|-----------|-------|--------------|---------
+| `⊣`     | Identity  | `I`   | Kestrel      | `K`
+| `⊢`     | Identity  | `I`   |              | `KI`
+| `∘`     | Bluebird  | `B`   | Blackbird    | `B₁`
+| `○`     | Bluebird  | `B`   | Psi?         | `D₂`-like: `labcd.a(bc)(bd)`
+| `˙`     | Kestrel   | `K`   |              | `KK`
+| `⊸`     |           | `R*S` | Queer        | `Q`
+| `⟜`     | Starling  | `S`   | ~Dove        | `D`-like: `labcd.ac(bd)`
+| `˜`     | Warbler   | `W`   | Cardinal     | `C`
+| `k G H` | Dove      | `D`   | Eagle        | `E`
+| `F G H` | Phoenix   | `S'`  | Golden Eagle | `Ê`-like: `labcde.a(bde)(cde)`
+
+The name "Golden Eagle" is a [fever dream](https://nitter.net/code_report/status/1440208242529882112#m) of bird enthusiast Conor Hoekstra, who saw it emerge from the Bald Eagle when arguments `fg` are set equal to `de`.
 
 Lambda calculus doesn't have BQN's polymorphism on one or two arguments, so each BQN combinator corresponds to two lambda calculus forms depending on the number of arguments, giving the two columns of birds above.
 
diff --git a/docs/doc/birds.html b/docs/doc/birds.html
index 073bfa1a..b9bd02e7 100644
--- a/docs/doc/birds.html
+++ b/docs/doc/birds.html
@@ -84,10 +84,11 @@
 <td align="center"><code><span class='Function'>F</span> <span class='Function'>G</span> <span class='Function'>H</span></code></td>
 <td>Phoenix</td>
 <td><code><span class='Function'>S</span><span class='String'>'</span></code></td>
-<td>~Bald Eagle</td>
+<td>Golden Eagle</td>
 <td><code><span class='Value'>Ê</span></code>-like: <code><span class='Value'>labcde.a</span><span class='Paren'>(</span><span class='Value'>bde</span><span class='Paren'>)(</span><span class='Value'>cde</span><span class='Paren'>)</span></code></td>
 </tr>
 </tbody>
 </table>
+<p>The name &quot;Golden Eagle&quot; is a <a href="https://nitter.net/code_report/status/1440208242529882112#m">fever dream</a> of bird enthusiast Conor Hoekstra, who saw it emerge from the Bald Eagle when arguments <code><span class='Value'>fg</span></code> are set equal to <code><span class='Value'>de</span></code>.</p>
 <p>Lambda calculus doesn't have BQN's polymorphism on one or two arguments, so each BQN combinator corresponds to two lambda calculus forms depending on the number of arguments, giving the two columns of birds above.</p>
 <p>Inputs are mapped to lambda calculus arguments according to the ordering <code><span class='Function'>𝔽𝔾</span><span class='Value'>𝕨𝕩</span></code>, and <code><span class='Function'>GFH</span></code> for a 3-train <code><span class='Function'>F</span> <span class='Function'>G</span> <span class='Function'>H</span></code>. For example, when I write that the combination <code><span class='Value'>𝕨</span> <span class='Function'>𝔽</span><span class='Modifier'>˜</span> <span class='Value'>𝕩</span></code> corresponds to a call of <code><span class='Function'>C</span></code> or <code><span class='Value'>labc.acb</span></code>, <code><span class='Value'>a</span></code> is <code><span class='Function'>𝔽</span></code> and <code><span class='Value'>bc</span></code> are <code><span class='Value'>𝕨𝕩</span></code>.</p>