There is an executable model (algorithmic description) of the rank conjunction in my APL95 paper "Rank and Uniformity". http://www.jsoftware.com/papers/rank.htm
----- Original Message ----- From: Terrence Brannon <[EMAIL PROTECTED]> Date: Thursday, April 5, 2007 8:42 am Subject: [Jgeneral] fleshing out the operation of negative verb rank > The negative verb rank section: > > http://www.jsoftware.com/help/jforc/loopless_code_i_verbs_have_r.htm#_Toc141157991 > was not very algorithmic. It wanted something more precise so I wrote > it. I only covered 1 of the 3 examples. > > +/ "_1 i. 2 3 > > 3 12 > > * verb rank: _1 > * noun rank: 2 > * therefore, r = _1 > * we must find the frame with respect to _1-cells > - let's take the absolute value of _1. This is 1 > - therefore the length of the frame is 1 > - because the shape of the input array is 2 3, > f = 2 > * because f = 2, we know that the output will look like this: > > ------------------- > | | | > ------------------- > > and we just need to stuff _1-cells in the boxes. > They will be of length 3, and so here is how we stuff the frame > (actually the frame is a shape, the list whose shape is the frame does > not have a word in J [but it should]): > > ------------------- > | 0 1 2 | 3 4 5 | > ------------------- > > Now we apply +/ to each box. Monadic +/ inserts a + between the items > of its noun. The items of a rank-1 array are atoms, so we have this: > > --------------------------- > | 0 + 1 + 2 | 3 + 4 + 5 | > --------------------------- > > and then this: > > ------------ > | 3 | 12 | > ------------ ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
