The only thing I can think of is

monad=: $:
dyad =: $:
ambi =: $:

Any other ideas?



On Mon, Mar 17, 2014 at 2:22 PM, Thomas Costigliola <[email protected]>wrote:

> Perhaps
>
>    s=. $:
>    ss=. $: 103!:0
>
>    >:@s f.
> >:@($: (103!:0))
>
>    >:@ss f.
> >:@($: (103!:0) (103!:0))
>
> NB. A bug or a gnat?
>
> So we are reduced to
>
>    s=: $:
>    f=.>:@s
>    g=.>:@($: 103!:0)
>
>    f=.f f.
>
>    (5!:1 <'f') -: 5!:1 <'g'
> 1
>
> We are basically just telling ourselves that the feature is turned on.
>
>
>
>
> On Mon, Mar 17, 2014 at 1:33 PM, Thomas Costigliola <[email protected]>wrote:
>
>> They will fail and should actually be removed instead of commented out.
>> Those tests were just checking that verbs containing $: that are fixed are
>> being properly wrapped in explicit definitions. They weren't executing the
>> verbs.
>>
>> Since verbs with $: that are fixed are no longer wrapped in explicit
>> definitions but rather in 103!:0 those tests are obsolete. We need new
>> tests for checking f. on verbs containing $:
>>
>>
>>
>>
>> On Mon, Mar 17, 2014 at 1:07 PM, Raul Miller <[email protected]>wrote:
>>
>>> I was referring to the line in recursion-scope-word-from-linear.patch
>>> which
>>> reads:
>>>
>>> +BORK=.0 : 0 NB. This stuff is obsoleted by 103!:
>>>
>>> This disables tests involving f. and $:
>>>
>>> I think this merits discussion.
>>>
>>> Thanks,
>>>
>>> --
>>> Raul
>>>
>>> p.s. here's the tests which get disabled:
>>>
>>> s    =: $:
>>> cap  =: [:
>>>
>>> monad=: 3 : '$: y'
>>> dyad =: 4 : 'x $: y'
>>> ambi =: (3 : '$: y') : (4 : 'x $: y')
>>>
>>> eq=: 2 : 0
>>>  f=: x f.
>>>  g=: y f.
>>>  assert. (5!:1 <'f') -: 5!:1 <'g'
>>>  1
>>> )
>>>
>>> >:@ s          eq (>:@ ambi       )
>>> >:@:s          eq (>:@:ambi       )
>>> >:@ s@ *:      eq (>:@ monad@ *:  )
>>> >:@:s@:*:      eq (>:@:monad@:*:  )
>>> s@ *:          eq (monad@ *:      )
>>> s@:*:          eq (monad@:*:      )
>>> s@ *:@ >:      eq (monad@ *:@ >:  )
>>> s@:*:@:>:      eq (monad@:*:@:>:  )
>>>
>>> s & *:         eq (ambi & *:      )
>>> s &:*:         eq (ambi &:*:      )
>>> s & *:@>:      eq (monad& *:@>:   )
>>> *& s           eq (* & monad      )
>>> *&.s           eq (* &.monad      )
>>> *&:s           eq (* &:monad      )
>>>
>>> s : +          eq (monad : +      )
>>> * : s          eq (*     : dyad   )
>>>
>>> s~             eq (dyad  ~        )
>>>
>>> s  ;.1         eq (  monad ;. 1   )
>>> +&s;._3        eq (+&monad ;. _3  )
>>>
>>> (+   s -     ) eq (+   dyad   -   )
>>> ([:  + s     ) eq ([:  +      ambi)
>>> ([:  s -     ) eq ([:  monad  -   )
>>> (cap s -     ) eq (cap monad  -   )
>>> (+   - s     ) eq (+   -      ambi)
>>> (* : (+ - s) ) eq (* : (+ - dyad) )
>>> ((+ - s) : > ) eq ((+ - monad) : >)
>>>
>>> (+ s         ) eq (+ monad        )
>>> (s   >:      ) eq (dyad   >:      )
>>> (s/          ) eq (dyad /         )
>>> (s/.         ) eq (monad/.        )
>>> (s\          ) eq (monad\         )
>>> (s\.         ) eq (monad\.        )
>>>
>>> (   s`!`+@.] ) eq (   ambi `!`+@.]       )
>>> (   ^`!`[email protected] ) eq (   ^    `!`[email protected]    )
>>> (%&(s`!`+@.])) eq (%&(monad`!`+@.]    )  )
>>> (%&(^`!`[email protected])) eq (%&(^    `!`[email protected])  )
>>> (s`!`+@.]@*  ) eq (   monad`!`+@.]    @ *)
>>> (^`!`[email protected]@*  ) eq (   ^    `!`[email protected]@ *)
>>>
>>> s"2@*:         eq (monad"2@*:   )
>>> s"2@*:@>:      eq (monad"2@*:@>:)
>>> s"2~           eq (dyad"2~      )
>>> (s"2 >: )      eq (dyad"2 >:    )
>>>
>>>
>>>
>>>
>>>
>>>
>>>
>>> On Mon, Mar 17, 2014 at 12:35 PM, Thomas Costigliola <[email protected]
>>> >wrote:
>>>
>>> > Raul, are you referring to the fact that it says "UNTESTED" next to the
>>> > downloads?
>>> >
>>> > They should pass the standard test suite. If I have time I will try to
>>> > confirm that. If anyone else can confirm, that would be nice too. That
>>> was
>>> > put there more for an extra disclaimer so that when your computer
>>> explodes
>>> > we can say "I told you so".
>>> >
>>> > There are no official tests for the extensions yet but Pepe's session
>>> could
>>> > be the basis for testing their validity.
>>> >
>>> > Finally, if anyone has comments on the code they would are welcome.
>>> >
>>> >
>>> > On Thu, Mar 13, 2014 at 7:40 PM, Raul Miller <[email protected]>
>>> > wrote:
>>> >
>>> > > Why disable tests?
>>> > >
>>> > > Thanks,
>>> > >
>>> > > --
>>> > > Raul
>>> > >
>>> > >
>>> > >
>>> > > On Thu, Mar 13, 2014 at 6:39 PM, Jose Mario Quintana <
>>> > > [email protected]> wrote:
>>> > >
>>> > > >  Bill,
>>> > > >
>>> > > > The script and session associated with the Journal of J article
>>> have
>>> > been
>>> > > > added to the page:
>>> > > >
>>> > > > http://www.2bestsystems.com/foundation/j/
>>> > > >
>>> > > >
>>> > > > Pascal,
>>> > > >
>>> > > > The kind of gerunds that you wanted to produce  in
>>> > > >
>>> > >
>>> http://www.jsoftware.com/pipermail/programming/2014-February/034904.html
>>> > :
>>> > > >
>>> > > >    3"_`(+:"_)` (-:"_)
>>> > > > ┌─────────────────┬──────────────┬──────────────┐
>>> > > > │┌─┬─────────────┐│┌─┬──────────┐│┌─┬──────────┐│
>>> > > > ││"│┌─────┬─────┐│││"│┌──┬─────┐│││"│┌──┬─────┐││
>>> > > > ││ ││┌─┬─┐│┌─┬─┐││││ ││+:│┌─┬─┐││││ ││-:│┌─┬─┐│││
>>> > > > ││ │││0│3│││0│_│││││ ││  ││0│_│││││ ││  ││0│_││││
>>> > > > ││ ││└─┴─┘│└─┴─┘││││ ││  │└─┴─┘││││ ││  │└─┴─┘│││
>>> > > > ││ │└─────┴─────┘│││ │└──┴─────┘│││ │└──┴─────┘││
>>> > > > │└─┴─────────────┘│└─┴──────────┘│└─┴──────────┘│
>>> > > > └─────────────────┴──────────────┴──────────────┘
>>> > > >
>>> > > > Can be produced as follows,
>>> > > >
>>> > > >    Rank=. , o ((train x tie&'' o rank ])"0) conj NB. " with rank
>>> zero
>>> > > >
>>> > > >    3`.+:`.-: Rank _ NB. Note the use of `. to handle nouns (as
>>> well as
>>> > > > verbs)
>>> > > > ┌─────────────────┬──────────────┬──────────────┐
>>> > > > │┌─┬─────────────┐│┌─┬──────────┐│┌─┬──────────┐│
>>> > > > ││"│┌─────┬─────┐│││"│┌──┬─────┐│││"│┌──┬─────┐││
>>> > > > ││ ││┌─┬─┐│┌─┬─┐││││ ││+:│┌─┬─┐││││ ││-:│┌─┬─┐│││
>>> > > > ││ │││0│3│││0│_│││││ ││  ││0│_│││││ ││  ││0│_││││
>>> > > > ││ ││└─┴─┘│└─┴─┘││││ ││  │└─┴─┘││││ ││  │└─┴─┘│││
>>> > > > ││ │└─────┴─────┘│││ │└──┴─────┘│││ │└──┴─────┘││
>>> > > > │└─┴─────────────┘│└─┴──────────┘│└─┴──────────┘│
>>> > > > └─────────────────┴──────────────┴──────────────┘
>>> > > >
>>> > > > See the script mentioned above for the definitions of the words
>>> > involved
>>> > > > (you can simply run the whole script first and the above sentences
>>> > > > afterwards).
>>> > > >
>>> > > >
>>> > > >
>>> > > >
>>> > > > On Wed, Mar 12, 2014 at 1:44 AM, bill lam <[email protected]>
>>> wrote:
>>> > > >
>>> > > > > An android toy version has been uploaded to
>>> > > > >
>>> > > > > http://www.jsoftware.com/download/j801
>>> > > > >
>>> > > > > Please provide some demo or test scripts. Thanks.
>>> > > > >
>>> > > > > --
>>> > > > > regards,
>>> > > > > ====================================================
>>> > > > > GPG key 1024D/4434BAB3 2008-08-24
>>> > > > > gpg --keyserver subkeys.pgp.net --recv-keys 4434BAB3
>>> > > > > gpg --keyserver subkeys.pgp.net --armor --export 4434BAB3
>>> > > > >
>>> > ----------------------------------------------------------------------
>>> > > > > For information about J forums see
>>> > http://www.jsoftware.com/forums.htm
>>> > > > >
>>> > > >
>>> ----------------------------------------------------------------------
>>> > > > For information about J forums see
>>> http://www.jsoftware.com/forums.htm
>>> > > >
>>> > >
>>> ----------------------------------------------------------------------
>>> > > For information about J forums see
>>> http://www.jsoftware.com/forums.htm
>>> > >
>>> > ----------------------------------------------------------------------
>>> > For information about J forums see http://www.jsoftware.com/forums.htm
>>> >
>>> ----------------------------------------------------------------------
>>> For information about J forums see http://www.jsoftware.com/forums.htm
>>>
>>
>>
>
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm

Reply via email to