I've gotten enough code working now in Ron Aaron's Reva to present to FORTH programmers for use as a system of dynamic lists with much of the power of a 0th generation APL , and also to mark a point at which I could really use some insights from some of my high powered ( mentally ) friends who actually know how to write an APL .
See CoSy/Language for an overview of the structure of the language and its objects . There is still a very long way to go , and there is no assurance that many of the words here will be stable - some will disappear as they are generalized - but many of the concepts will remain .

While general recursive arrays and the requisite reference counting appear to be working , it's just operations on simple arrays I'll discuss now .

The way I use Reva is to download the current version in to a \revaArk directory then unzip it into \ creating , or overwriting \reva . Make a directory \reva\CoSy and extract CoSy.zip into it .

Then cd to \reva and execute bin\reva CoSy\CoSy.f . I keep a CoSy.bat file with this instruction in \reva as a shortcut .

In the current file , the varible DEBUGGING is on which compiles tracking messages for allocation , freeing and reference counting of objects . It also has prompt vectored to stkprmpt to type .s in Hex on every execution . undo prompt will restore the standard prompt .