HDTenEightyP/NetNews huggingface dataset:
From: dmurdoch@QueensU.CA (Duncan Murdoch)
Subject: Re: Matrix routines in pascal
Organization: Queen's University, Kingston, Canada
Distribution: usa
Date: Wed, 29 Jul 1992 17:58:04 GMT

In article <1992Jul29.162918.13707@csi.jpl.nasa.gov> eldred@rrunner.jpl.nasa.gov (Dan Eldred) writes:
>
>For people who attempt to do numerical programming in pascal:  how
>do you handle matrices?  In particular, what approach do you use to
>create general purpose routines like matrix multiply, inversion,
>eigensystems, etc.?  If you have a pascal compiler that allows
>conformant arrays, this is pretty easy--either do Fortran style
>calls in which the dimensions are passed as parameters, or pass
>a record structure which has the dimensions embedded.  But I'm
>having trouble coming up with a satisfactory strategy for ANS
>pascal (i.e. Think Pascal 4.0 on the Mac).  Suggestions?

Think Pascal includes OOP extensions, doesn't it?  If so, making a
matrix object is probably the best way to go.  That's how I handle
matrices in Turbo Pascal.  The big problem there is the 64K limit on
size; that means I have to go through all sorts of gyrations to handle
large matrices, since 90 by 90 is the biggest matrix of doubles that
fits in 64K.

Duncan Murdoch
dmurdoch@mast.queensu.ca
From: S_JUFFA@iravcl.ira.uka.de (|S| Norbert Juffa)
Newsgroups: comp.lang.pascal
Subject: Re: When is next TP release?
Date: 22 Jul 1992 11:02:16 GMT
Organization: University of Karlsruhe (FRG) - Informatik Rechnerabt.
Distribution: world
NNTP-Posting-Host: irav1.ira.uka.de
X-News-Reader: VMS NEWS 1.23

In <1992Jul18.152320.6788@mailhost.aa.cad.slb.com> wilson@mailhost.aa.cad.slb.com writes:

> I know this question comes up periodically, but I haven't heard
> anything in months:  when can we expect the next version of
> Turbo Pascal?
> 
> It seems like it's been a long time since 6.0 came out.  Based
> on past experience (5.0, 5.5, 6.0) I would have expected a release
> by now.  It's a "subscription" business, after all.
> 
> Perhaps I'm missing the boat.  Maybe all of the new stuff will
> be for windows, and the DOS stuff is being left behind??
> 
> Just looking for the latest news.
> 
> Dave Wilson

TP 7.0 beta versions are not to be expected before 4Q 92, so the final release
date for TP 7.0 is most likely not before 1Q 93.

Norbert
-------------------------------------------------------------------------------
Norbert Juffa      email: S_JUFFA@IRAVCL.IRA.UKA.DE      Live and let live!
From: sl8nl@cc.usu.edu
Newsgroups: comp.lang.pascal
Subject: <None>
Date: 26 Jul 92 23:16:21 MDT
Organization: Utah State University

In article <AA0zfQgyMD@utrade.e-burg.su>, soi@utrade.e-burg.su (Oleg I. Subachev) writes:
> Dear Madams and Sirs !!!
> 
> Can anybody hint me whether there is any hook to pass various
> number of parameters to TP 6.0 functions and procedures.
> 

Turbo Pascal 6 doesn't have this ability, but Stony Brook Pascal+ does.  It
is fully TP6 compatible.  Email me if you want the address.
From: phfrom@nyx.uni-konstanz.de (Hartmut Frommert)
Newsgroups: comp.lang.pascal
Subject: Re: Constants in an Object
Date: 21 Jul 92 08:05:26 GMT
Article-I.D.: nyx.phfrom.183
Organization: Dept. of Physics, University of Constance

jwstuart@ecst.csuchico.edu (Jesse William Leo Stuart) writes:

>       Does anyone know of a way to include constants in a TP6.0 object 
>declaration?

As in records you can have fields in objects which are constant after 
initialization, simply by declaring

type
  TMyObject=object
    MyConst: Integer;
..
    constructor Init;
  end;

constructor TMyObject.Init;
begin
  MyConst := 345;
..
end;

What I didn't try up to now is

const
  MyObject: TMyObject = (345);

or thelike. I assume this failes because no memory is reserved for MyObject;
this is done by the constructor call. For this reason I assume that objects 
cannot be initialized as constants, but only by

var
  MyObject: TMyObject;
..
MyObject.Init;
..

Hope this helps.
--
 Hartmut Frommert, LS Dehnen, Physics, | E-Mail: <phfrom@dknkurz1.bitnet>
 Univ of Constance, P.O.Box 55 60,     |     or  <phfrom@nyx.uni-konstanz.de>
 D-W-7750 Constance, Germany  | + SAVE THE WHALES ! BOYCOTT NORWAY !        +
 Phone: +49-(0)7531-88-3747   | + Whales R intelligent. Whale killers not.  +
+ Whale killing is murder. Eating whales is cannibalism. Eat whale killers. +
From: bobb@vice.ICO.TEK.COM (Bob Beauchaine)
Newsgroups: comp.lang.pascal
Subject: Re: how long is a clock cycle (was source for DELAY procedure)?
Date: 30 Jul 92 23:12:01 GMT
Organization: Tektronix, Inc., Beaverton,  OR.

In article <Bs7Hv8.Bqz@news.cso.uiuc.edu> amead@s.psych.uiuc.edu (Alan Mead) writes:
>
>I want to run another process during a Delay().  I don't want people to
>overflow the BIOS keyboard buffer (it beeps then and that is bad for this
>app).  I think the easiest way will do this is something like:
>

  Another possibility is to move the keyboard buffer to a section of
  memory the size of which you define.  This is especially
  attractive if you want to actually read the user's keystrokes that
  happen during your delay instead of just discarding them.  Code
  available upon request.


/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ 

Bob Beauchaine bobb@vice.ICO.TEK.COM 

C: The language that combines the power of assembly language with the 
   flexibility of assembly language.

Real friends don't let friends use UNIX.
Newsgroups: comp.lang.pascal
From: venaas@siri.unit.no (Stig Venaas)
Subject: Invalid PUBLIC definition error in TP55
Organization: University of Trondheim
Date: Wed, 29 Jul 92 16:32:35 GMT

I'm trying to use some assembler routines with TP. I've
compiled them to obj files and have linked them into the
pascal source by using the the {L ....}. 
When I compile I getan invalid public def. error. I've
checked all the possible causes that the manual states, but I
can't see anything wrong.

Does anyone have any experiences with this error? What are the
likely causes (other than those in the manual)?

Stig
From: curzon@trooa.enet.dec.com (Richard Curzon)
Newsgroups: comp.lang.pascal
Subject: TPW
Date: 23 Jul 92 17:21:24 GMT
Organization: Digital Equipment Corporation


     I'm in decision mode, need some inputs:

     What kind of Object library is included in the TPW environment (how 
many classes / richness of Collection classes, Stream classes if any / or 
any other input)

     Disk Appetite... how much hard disk is needed for TPW?
	
	thanks for any input.

                                Richard Curzon, Digital Equipment of Canada
				Toronto
   (from INTERNET)     curzon@trooa.ENET.dec.com 
   (from COMPUSERVE)   71371,2521  OR  >INTERNET:curzon@trooa.ENET.dec.com
Newsgroups: comp.lang.apl
From: hui@yrloc.ipsa.reuter.COM (Roger Hui)
Subject: Re: Possible Catenation Bug In J 5.0 for the NeXT
Organization: Iverson Software Inc.
Date: Mon, 27 Jul 92 16:03:52 GMT

Tom Affinito writes:
>In 5.0 for the NeXT this happens
>   (1 3 $ 1 2 3),1 2
>1 2 3
>1 0 0
>
>While in previous versions this would happen
>   (1 3 $ 1 2 3),1 2
>1 2 3
>1 2 0

This is a (known) bug.  These and some other bugs will be fixed in J5.1 
expected to be released shortly.  Thanks for reporting the problem.

------------------------------------
Roger Hui, Iverson Software Inc., 33 Major Street, Toronto, Ontario  M5S 2K9
Phone: (416) 925 6096;  Fax: (416) 488 7559
Newsgroups: comp.lang.apl
From: rbe@yrloc.ipsa.reuter.COM (Robert Bernecky)
Subject: Re: SIGNUM of teaching numerical methods
Reply-To: rbe@yrloc.ipsa.reuter.COM (Robert Bernecky)
Organization: Snake Island Research Inc, Toronto
Date: Thu, 23 Jul 92 05:01:13 GMT

In article <1089@kepler1.rentec.com> andrew@rentec.com (Andrew Mullhaupt) writes:
>In article <ROCKWELL.92Jul19155653@socrates.umd.edu> rockwell@socrates.umd.edu (Raul Deluth Miller-Rockwell) writes:
>>Andrew Mullhaupt:
>>   Small consolation, given what APL/J might have been...
>is wanted.
>
>>   Oh by the way - I should point out that Splus isn't perfect either
>>   - it has the stupidest function calling ever implemented in an
>>   interpreter - it _copies_ every argument so that functions can't
>>   modify their arguments, _no matter how large they are_. 
>
>No. Having talked to the people who implement it, they maintain that they
>are constrained by the language spec. (And why shouldn't they be?)

This is baloney. (Bullshit in our terms): It is, first of all,
IRRELAVENT to the language spec as to HOW something is implemented.
Semantics is all. It is TRIVIAL to implement a language such as Splus
such that it avoids copying arguments except when a callee tries to tinker
an argument by modifying it. 

If you don't believe me, hire Snake Island Research, and we'll fix you
up ASAP, and give you a substantial performance boost.

>On the other hand, they have told me that they are experimenting with a
>'flag' which will allow you to write functions which do not always copy
>their arguments. This is pretty thin soup, since you will have no way of

This is not experimentation, since it's been done for 20 years or more.

>be non-stupid. And for this who can blame the implementer? How does he know
>that nobody ever 'cheated' and relied on a standard function to copy its
>arguments in another important standard function? No what we need is a

Easy. Strong semantics. If someone tries to tinker some array which has
been passed as a parameter, and you need the copy outside the current
scope, you make a copy. If not, you proceed. Big deal.


Robert Bernecky      rbe@yrloc.ipsa.reuter.com  bernecky@itrchq.itrc.on.ca 
Snake Island Research Inc  (416) 368-6944   FAX: (416) 360-4694 
18 Fifth Street, Ward's Island
Toronto, Ontario M5J 2B9 
Canada
Newsgroups: comp.lang.apl
From: "Jack Rudd" <JACKRUDD@BLDFVM1.VNET.IBM.COM>
Subject: APL compilers and translators
Organization: University of Waterloo
Date: Fri, 24 Jul 1992 04:53:48 GMT

Mike Kent:

 >Oh, and BTW if you want an APL compiler you might contact STSC --
 >they sell one which works within their mainframe product -- or
 >Interprocess Systems -- they have the Yorktown APL Translator (APL to
 >FORTRAN, vector FORTRAN if you like) which IBM Research did originally,
 >only now as a nicely packaged product [IS is an IBM Business Partner].
 >Or if your code has to run on a Cray, drop a note to Bob Bernecky and ask
 >about ACORN -- APL to Cray C.

Also to discuss the current state of automatic APL-to-C translation,
I recommend contacting Wai-Mee Ching at IBM Research in Yorktown Heights:
(914) 784-7748        (This is not a product solicitation)

Jack Rudd
From: v071rw4p@ubvmsb.cc.buffalo.edu (EMIL MARCUS)
Newsgroups: comp.lang.apl
Subject: AWK Language
Date: 29 Jul 92 20:29:00 GMT
Organization: University at Buffalo
News-Software: VAX/VMS VNEWS 1.41


     I am interested in learning AWK.   
     Could you, please, help me find a book on AWK ?
     'Much obliged !
Emil
--------
     Emil Marcus    V071RW4P@ubvms.cc.buffalo.edu    
     		
Newsgroups: comp.lang.apl
From: rbe@yrloc.ipsa.reuter.COM (Robert Bernecky)
Subject: Re: SIGNUM of teaching numerical methods
Reply-To: rbe@yrloc.ipsa.reuter.COM (Robert Bernecky)
Organization: Snake Island Research Inc, Toronto
Date: Tue, 28 Jul 92 14:48:11 GMT

In article <1117@kepler1.rentec.com> andrew@rentec.com (Andrew Mullhaupt) writes:
>In article <1992Jul23.045513.20017@yrloc.ipsa.reuter.COM> rbe@yrloc.ipsa.reuter.COM (Robert Bernecky) writes:
>>In article <1088@kepler1.rentec.com> andrew@rentec.com (Andrew Mullhaupt) writes:
>
>>a. WHEN APL code can compete in loopy-type stuff, with Fortran,
>>   many arguments against APL will vanish.
>
>Yes. And what I _really_ want to know is why is this not a problem which
>has been solved ten years ago?

Well, partially because nobody knew HOW to solve it then. A major problem
with traditional functional languages is making them run fast on REAL 
problems. Researchers are only now coming up with ideas on speedups
for such languages. And not all of the languages being dealt with have
the flexibility of APL with respect to late binding, array type, rank,
shape changes, etc.

>
>Agree. In fact the strongest programmer I know regards anything where you
>don't have asynchronous parallelism as trivial. He's probably in some sense
>right.

According to The Venerable Bede, appeal to authority is the weakest form
of argument.

>Paradoxically, the less you will be forced to do in post-APL, the less you will
>avoid it. The less religion is required before using post-APL, the more popular
>it will be.
>
>Now my desiderata are on the table. I think you can take APL as a starting
>point and get to the promised land. (Else why would I keep involved in
>comp.lang.apl?)
>
>I may be wrong, but I think (based on my very limited exposure) that J does
>not go in the direction I'm pointing in. So from where I sit the field is
>vacant in the search for post-APL.

OK, so you don't like J and APL. What direction DO you like? Why?


Robert Bernecky      rbe@yrloc.ipsa.reuter.com  bernecky@itrchq.itrc.on.ca 
Snake Island Research Inc  (416) 368-6944   FAX: (416) 360-4694 
18 Fifth Street, Ward's Island
Toronto, Ontario M5J 2B9 
Canada
Newsgroups: comp.lang.apl
From: hui@yrloc.ipsa.reuter.COM (Roger Hui)
Subject: Re: J table question
Organization: Iverson Software Inc.
Date: Mon, 27 Jul 92 14:59:59 GMT

Brian Schott:
> I am trying to create a table which has the result 1 if x is 0 and
> the lesser of 1 and y%x otherwise. ... 0<=x,y<=1.
 
Raul Deluth-Miller Rockwell:
> Note that 1 <. y % x will do what you want except for the case where
> both x is zero and y is less than or equal to zero.  [At least, for
> versions 4 and 5 of J.]  If this qualification matches your data, I'd
> recommend using the simple expression.
 
Brian Schott:
> Yes, I thought of that, but the 0%0 case messes things up for me; I need
> 1, not 0.
 
Roger Hui:
>The overall problem can be solved without agenda, viz., 1<.y%x+y*0=x ;
>with agenda, x (1&<.@%~)`1:@.(0&=@[)"0 y .
 
Brian Schott:
> I had some difficulty implementing this non-agenda solution since my
> left and right vectors are not necessarily of same shape.
 
I guess I was misled by the original problem description.  In any case, 
if f is a solution to the elementwise problem, then f"0/ is a solution 
to the table problem.  Thus:
 
   f =. (] + 0&=@+) 1&<.@% [ + 0&=@[ * ]    NB. 1<.(y+0=x+y)%x+(0=x)*y
   g =. 1&<.@%~`1:@.(0&=@[)"0
 
   ] x =. (i.6)%5
0 0.2 0.4 0.6 0.8 1
   ] y =. (i.8)%7
0 0.142857 0.285714 0.428571 0.571429 0.714286 0.857143 1
 
   x f |.x
1 1 1 0.666667 0.25 0
   x f"0/y
1        1        1        1        1        1        1 1
0 0.714286        1        1        1        1        1 1
0 0.357143 0.714286        1        1        1        1 1
0 0.238095  0.47619 0.714286 0.952381        1        1 1
0 0.178571 0.357143 0.535714 0.714286 0.892857        1 1
0 0.142857 0.285714 0.428571 0.571429 0.714286 0.857143 1
   (x f |.x) -: x g |.x
1
   (x f"0/y) -: x g/y      NB. g"0 <-> g
1
 
Brian Schott:
>    gog =. 1&<.@%~/ ` 1: @. (0&=@(]"0))/
>      ...
> I would be interested in your comments regarding the **2** table
> operations (?) in this solution.  My solution resulted from a mistake
> and other experimentations.  The mistake was that I thought the right-
> most / operating only on the righthand argument of @. , but it applies
> to the whole structure.  But that's not enough.  The lefthand portion
> of the gerund also requires its own / .
 
The first (leftmost) / in gog is redundant (gog produces the same result if 
it is removed).  The result of gog differs from those of f"0/ and g/ because 
gog keys on 0=y whereas f"0/ and g/ key on 0=x, per the original description.

------------------------------------
Roger Hui, Iverson Software Inc., 33 Major Street, Toronto, Ontario  M5S 2K9
Phone: (416) 925 6096;  Fax: (416) 488 7559
Newsgroups: comp.lang.apl
From: qmdbms@gsusgi2.gsu.edu (Brian Schott)
Subject: Re: J table question
Organization: Georgia State University
Date: Sat, 25 Jul 1992 14:43:28 GMT

hui@yrloc.ipsa.reuter.COM (Roger Hui) writes:

>Brian Schott writes:

>> I am trying to create a table which has the result 1 if x is 0
>> and the lesser of 1 and y%x otherwise.  My scheme is to set this
>> up as an agenda construct with the selection of the index
>> determined by whether the left argument x equals 0.  So my idea is
>>    gerund @. selection    where "selection" is [/ .
> 
>> But I am running into a problem because the result of x [/ y
>> is a vector, not a table.  That surprises me since x */ y
>> is a table.  Is this as it should be in J?
> 
>> BTW my vector arguments are all fractions  0<=x,y<=1.
> 
>The overall problem can be solved without agenda, viz., 1<.y%x+y*0=x ;
>with agenda, x (1&<.@%~)`1:@.(0&=@[)"0 y .
I had some difficulty implementing this non-agenda solution since my
left and right vectors are not necessarily of same shape.

I tried the agenda version and had considerable fun figuring where
to put the table adverb and where not to.  The solution I am working
with for now is listed below.

   ]u =. 5%~ i. 6
0 0.2 0.4 0.6 0.8 1
   ]v =. }:u
0 0.2 0.4 0.6 0.8
   gog =. 1&<.@%~/ ` 1: @. (0&=@(]"0))/
   v gog u
1        1        1    1 1 1
1        1        1    1 1 1
1      0.5        1    1 1 1
1 0.333333 0.666667    1 1 1
1     0.25      0.5 0.75 1 1
   gog
+----------------------------------------------------+-+
|+---------------------------+--+-------------------+|/|
||+----------------------+--+|@.|+-------+-+-------+|| |
|||+------------------+-+|1:||  ||+-+-+-+|@|+-+-+-+||| |
||||+--------------+-+|/||  ||  |||0|&|=|| ||]|"|0|||| |
|||||+--------+-+-+|~|| ||  ||  ||+-+-+-+| |+-+-+-+||| |
||||||+-+-+--+|@|%|| || ||  ||  |+-------+-+-------+|| |
|||||||1|&|<.|| | || || ||  ||  |                   || |
||||||+-+-+--+| | || || ||  ||  |                   || |
|||||+--------+-+-+| || ||  ||  |                   || |
||||+--------------+-+| ||  ||  |                   || |
|||+------------------+-+|  ||  |                   || |
||+----------------------+--+|  |                   || |
|+---------------------------+--+-------------------+| |
+----------------------------------------------------+-+
   I would be interested in your comments regarding the **2** table 
operations (?) in this solution.  My solution resulted from a mistake
and other experimentations.  The mistake was that I thought the right-
most / operating only on the righthand argument of @. , but it applies
to the whole structure.  But that's not enough.  The lefthand portion
of the gerund also requires its own / .


-- 
Brian Schott/Decision Sciences Dept.             qmdbms@gsusgi2.gsu.edu
College of Business Administration                         404-651-4070
Georgia State University                  interests: approx. reasoning,
Atlanta, Georgia USA 30303-3083     (B=)       decision support systems
Newsgroups: comp.lang.apl
From: wchang@cshl.org (Bill Chang)
Subject: Re: SIGNUM of teaching numerical methods
Organization: Cold Spring Harbor Laboratory
Date: Fri, 31 Jul 92 19:51:36 GMT

Re: syntax translation/macro preprocessing/function restriction

The problem as I see it, is reporting of compile/runtime errors. Preprocessors
are easy to write but the ones I use (C, TeX/LaTeX) are pretty terrible at 
this. Error messages are at the level of the language kernel and can bear 
no resemblance to the source code. I can see how to translate APL error 
messages back into my ASCII APL, keeping track of positions of tokens--
because the translation is reversible and very "linear". With f(...) and 
(...)T and macros the problem becomes harder. Not insurmountable ("tag the 
translation product"), but just hard enough that (most) people don't bother.
I think this is why LISP has remained lispy :-) and would guess a great deal 
of work went into Macsyma just to solve this problem.

An APL to C/Fortran compiler ought to address this too; otherwise it may become 
easier to hand-translate from scratch (what I often do) than to try to debug 
code produced by the compiler.

-- Bill Chang (wchang@cshl.org)                 Cold Spring Harbor Lab., NY
Newsgroups: comp.lang.apl
From: rockwell@socrates.umd.edu (Raul Deluth Miller-Rockwell)
Subject: Re: Meaning of x 6!:2 in J version 5
Organization: Traveller
Date: Mon, 27 Jul 1992 00:11:54 GMT

Tom Affinito:
   (6!:2) Unfortunately this is not described in the xenos.doc, but
   through experimentation it appears to time the y string x number of
   times and returns the average time.
...
   Can anyone confirm or correct this interpretation?

Yep, looks like that to me, too.

-- 
Raul Deluth Miller-Rockwell                   <rockwell@socrates.umd.edu>
Newsgroups: comp.lang.apl
From: trirex!taff@uunet.uu.net (Tom Affinito)
Subject: Possible Catenation Bug In J 5.0 for the NeXT
Reply-To: trirex!taff@uunet.uu.net
Organization: Trirex Systems Inc.
Distribution: na
Date: Fri, 24 Jul 1992 21:53:01 GMT

In 5.0 for the NeXT this happens
   (1 3 $ 1 2 3),1 2
1 2 3
1 0 0

While in previous versions this would happen
   (1 3 $ 1 2 3),1 2
1 2 3
1 2 0


The 5.0 behaviour is, I believe, buggy.  The problem arises with  
catenation of shorter vectors or strings being appended to wider tables,  
which result now in only the first character or number being appended.   
This is particularly troublesome when building up functions from character  
arrays ala the tutorial.

Is this a NeXT-only bug, or is it widespread in other 5.0's?  [I used the  
NeXT executable from Waterloo and I compiled my own from the source and  
the problem persists].

Tom
trirex!taff@uunet.uu.net
From: rockwell@socrates.umd.edu (Raul Deluth Miller-Rockwell)
Subject: Re: J gerund question
Organization: Traveller
Date: Tue, 21 Jul 1992 14:09:38 GMT

Brian Schott:
   I have an array of constants shaped 15 3 and I have 3 monadic verbs
   which I want to apply to each item of the array.  I want the result
   to be a 15 3 shaped array.  For example if the verbs were +, -, and
   * then I would expect to make a gerund of them such as + ` - ` * .
   Then if the array is a =. i. 15 3, I want the result to be
     0  _1  1
     3  _4  1
     6  _7  1
     ...

Well, I don't have my J manual handy, and I think there's something
more suited to this than agenda, but.. just off the top of my head
there is a way of making agenda to work:
 a =. i. 5 3
 g =. + ` - ` *
 y =. <@,"0
 threes=. 3&| @(i.@$)
 newg =.(<,'@')y g y <,']'
   (threes  (newg) @. ["0  ]) a
 0  _1 1
 3  _4 1
 6  _7 1
 9 _10 1
12 _13 1
 
Making this work for dyadic arguments is a little more unpleasant [you
have to put the arguments in boxes, catenate them together, then build
the gerund which picks out the arguments and applies them to the
appropriate function.

Meanwhile, maybe someone with a copy of the dictionary handy can give
you a simpler mechanism for doing what you want.

-- 
Raul Deluth Miller-Rockwell                   <rockwell@socrates.umd.edu>
From: andrew@rentec.com (Andrew Mullhaupt)
Newsgroups: comp.lang.apl
Subject: Re: SIGNUM of teaching numerical methods
Date: 27 Jul 92 20:08:14 GMT
Organization: Renaissance Technologies Corp., Setauket, NY.

In article <ROCKWELL.92Jul26190755@socrates.umd.edu> rockwell@socrates.umd.edu (Raul Deluth Miller-Rockwell) writes:
>Andrew Mullhaupt:
>   Yes. And what I _really_ want to know is why is this not a problem
>   which has been solved ten years ago?
>
>It was.  The compiler we use at work is about that old.

Is it full bandwidth compilation? I.e. if I write say, a secant method to
solve a simple equation will it be as fast as C or FORTRAN? How close is it?

And does this compiler compile all of APL? Or if I execute some string which
I build up will it be just a transparent shell for the interpreter...

And can I call in and out of other compiled languages promiscuously, without
fear of copying data?

I think compiled APL should be one of the more useful things. However the APL
gurus I used to know had a concensus view that they were'nt good enough yet.

Have things changed since 1990?

Later,
Andrew Mullhaupt

Newsgroups: comp.lang.apl