diff options
| author | Marshall Lochbaum <mwlochbaum@gmail.com> | 2022-08-02 22:31:41 -0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-08-02 22:31:41 -0400 |
| commit | 5e9f9f93ef664a98856a6c25bce87e84a5403403 (patch) | |
| tree | b7ea1342a4a9c31529976514d8bc5eada6a08cbe /doc | |
| parent | e219af48401473a7bac49bdd8b89d69082cf5dd8 (diff) | |
| parent | bbe787fc41bd6e88d97d277ef481cec023b7d279 (diff) | |
Merge pull request #75 from codereport/birds
:memo: Update to Combinator Birds
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/birds.md | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/birds.md b/doc/birds.md index 54311148..26c122c6 100644 --- a/doc/birds.md +++ b/doc/birds.md @@ -19,10 +19,10 @@ Some people consider it reasonable to name [combinators](primitive.md#modifiers) | `⟜` | 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)` | +| `F G H` | Phoenix | `Φ` | Pheasant | `Φ₁` | 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. Inputs are mapped to lambda calculus arguments according to the ordering `𝔽𝔾𝕨𝕩`, and `GFH` for a 3-train `F G H`. For example, when I write that the combination `𝕨 𝔽˜ 𝕩` corresponds to a call of `C` or `labc.acb`, `a` is `𝔽` and `bc` are `𝕨𝕩`. -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 disordered from the Bald Eagle when arguments `fg` are set equal to `cd`. +Note that the name "Pheasant" comes from [Hoekstra 2022](https://github.com/codereport/Content/blob/main/Publications/Combinatory_Logic_and_Combinators_in_Array_Languages.pdf). It was previously nicknamed ["Golden Eagle"](https://nitter.net/code_report/status/1440208242529882112#m) before Conor discovered Haskell Curry had introduced this combinator in his 1931 paper [The universal quantifier in combinatory logic](https://www.jstor.org/stable/1968422). |