Or, did you mean that now that f and h can either or both be called monadically
or dyadically, we don't need them as pre-processors anymore, and the dyad g
would suffice, given proper arguments ?
That's a fair point. It may be that
f and h would nearly always be just. , as in. u"(,`g`,) so we could just
define them that way:
u"v y <=> u"( mru v&, #$y)y
x u"v y <=> x u"( (lru,rru) v x ,&#&$ y )y
(or maybe we elide the &, in the monadic case.)
Anyway, something like:
u"v <=> u"( ,@:( _2: : 1: {. u b.@:0: ) v ,&#&$)
That doesn't separate monad and dyad as cleanly (v would have to inspect
lengths of its arguments to know, or their ranks if we elide the &, in the
monad case), and wouldn't work if we wanted the shapes of y or x instead of
just their ranks - but it is much simpler, and gives us easy access to all the
pertinent information.
Of course, this definition precludes the earlier proposal for u"(v y) and u"(x
v y), but if we are saying only rank information is pertinent to the RHA of u,
then value information is not pertinent, and we do not need or even want the
original arguments.
-Dan
Please excuse typos; composed on a handheld device.
-----Original Message-----
From: Raul Miller <[email protected]>
Sender: [email protected]
Date: Thu, 11 Nov 2010 07:19:12
To: Programming forum<[email protected]>
Reply-To: Programming forum <[email protected]>
Subject: Re: [Jprogramming] Atop u...@v with v of negative monadic rank
On Thu, Nov 11, 2010 at 6:54 AM, Dan Bron <[email protected]> wrote:
> Does anyone see a reason why f may be interested in all the ranks of u
> simultaneously*, or have any other comments?
I am having problems envisioning any cases where f and h
do anything useful.
--
Raul
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
