Sharp APL (really SAPL and APL2 arrays) 
Author Message
 Sharp APL (really SAPL and APL2 arrays)

 I hope someone else gives you a definite reference. I'll just briefly mention
that Trenchard Moore proved to his own satisfaction (and to the satisfaction of
everyone else who cared to look into his proof) that the two schemes are
fundamentally equivalent, ie there are no important differences on any deep
levels. This was before anyone implemented either scheme.

 Our enclose (which many people call box) and the STSC/NARS definition (adopted
by APL2) differ primarily in that APL2 says that enclose of a scalar returns
the scalar unchanged, while we (Sharp) say that the enclose of any object is a
new, different, object. There are many differences in the two systems, some of
which are tracable to this distinction (the different definition of reduction,
for example, is inextricably mixed up with this issue), and some of which are
not (the pervasion of functions into the depths of APL2 arrays has absolutely
nothing to do with the definition of enclose, regardless of what some APL2
supporters might suggest). APL2's extended use of strand notation is another
place where Sharp APL seems significantly different, but again the reason has
nothing to do with the choice of enclose axiom system.

 You didn't say why you asked your question, so I don't know if this is any
help; I hope it's of *some* use../Leigh

It's only work if somebody makes you do it    .../Calvin

Mon, 20 Mar 1995 06:26:46 GMT  
 [ 1 post ] 

 Relevant Pages 

1. Sharp APL arrays vs. APL2/APL*Plus II arrays

2. APL FAQ - correction re Sharp APL

3. Sharp APL (Was: questions on early APL

4. Sharp APL vs IBM APL ??????

5. Announcement: Version 4.03 of SHARP APL for UNIX

6. Sharp APL/PC reference binders

7. Product announcement - SHARP APL/UNIX 4.02


9. Sharp APL

10. Sharp Packages (was Re: APL acceptance)

11. sharp i-apl



Powered by phpBB® Forum Software