From e4edda2a8cf2309b77808cc749a8e6ff8a282b17 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Tue, 26 Oct 2021 09:09:38 -0400 Subject: Typo --- docs/spec/inferred.html | 2 +- spec/inferred.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/spec/inferred.html b/docs/spec/inferred.html index 08041156..b4c5d3f5 100644 --- a/docs/spec/inferred.html +++ b/docs/spec/inferred.html @@ -474,7 +474,7 @@
  • Structural Under: If 𝔾 is a structural function (to be defined below) and v is compatible with 𝔾 on 𝕩, then the result is obtained by inserting v back into 𝕩.
  • Computational Under: If 𝔾 is provably not a structural function, then the result is 𝔾⁼v if it is defined.
    • -

    When implementing, there is no need to implement invertable Under specially: it can be handled as part of the structural and computation cases.

    +

    When implementing, there is no need to implement invertible Under specially: it can be handled as part of the structural and computation cases.

    Mathematical definition of structural Under

    In general, structural Under requires information from the original right argument to be computed. Here we will define the structural inverse of structural function 𝔾 on v into 𝕩, where 𝕩 gives this information. The value π•¨π”½βŒΎπ”Ύπ•© is then the structural inverse of 𝔾 on 𝕨𝔽○𝔾𝕩 into 𝕩.

    We define a structure to be either the value Β· or an array of structures (substitute 0 or any other specific value for Β· if you'd like structures to be a subset of BQN arrays; the value is irrelevant). A given structure s captures a BQN value or structure 𝕩 if it is Β·, or if s and 𝕩 are arrays of the same shape, and each element of s captures the corresponding element of 𝕩. Thus a structure shares some or all of the structural information in arrays it captures, but none of the data.

    diff --git a/spec/inferred.md b/spec/inferred.md index 73fc4abd..ee899f5d 100644 --- a/spec/inferred.md +++ b/spec/inferred.md @@ -174,7 +174,7 @@ Let `v←𝕨𝔽○𝔾𝕩`, so that `v≑𝔾z`. `v` is of course well-define - *Structural* Under: If `𝔾` is a structural function (to be defined below) and `v` is compatible with `𝔾` on `𝕩`, then the result is obtained by inserting `v` back into `𝕩`. - *Computational* Under: If `𝔾` is provably not a structural function, then the result is `𝔾⁼v` if it is defined. -When implementing, there is no need to implement invertable Under specially: it can be handled as part of the structural and computation cases. +When implementing, there is no need to implement invertible Under specially: it can be handled as part of the structural and computation cases. ### Mathematical definition of structural Under -- cgit v1.2.3