[Jprogramming] Deduction, Induction, and Prediction.

[Brian Schott]

I had never considered such a model for m`:0 . But yours is quite
enlightening to me.

On Fri, Dec 21, 2012 at 2:54 PM, Peter B. Kessler
<Peter.B.Kessler at oracle.com> wrote:
> Thanks for making me look at the Dictionary for m`:n (Evoke Gerund).  Is
> there some point in having that entry show the equivalence of, for example,
>
>       + ` - ` * ` % `:0 i. 5
>    0  1   2        3    4
>    0 _1  _2       _3   _4
>    0  1   1        1    1
>    _  1 0.5 0.333333 0.25
>         (+ , - , * ,: %) i. 5
>    0  1   2        3    4
>    0 _1  _2       _3   _4
>    0  1   1        1    1
>    _  1 0.5 0.333333 0.25
>
>       (+ ` - ` * ` % `:0 i. 5) -: ((+ , - , * ,: %) i. 5)  NB. Check if they
> Match with -:
>    1
>
> The point being to give a model for m`:0 as there is for m`:3 and m`:6, and
> to show that m`:0 isn't quite a simple "Append" as the Dictionary says, but
> a Laminate (,:) followed by Appends (,) as needed.  There may well be a
> better model for m`:0.  I might almost be able to remember the symmetry
> between ` and , and `: and ,: which is visually pleasing.
>
>                         ... peter
>

-- 
(B=)