Algol 68 implementations (Was Please

[alistair at bdcvax.UUCP]

Lyndon Nerenberg, ncc!lyndon writes:
 
> In article <4577 at brl-adm.ARPA>, TVR%CCRMA-F4 at SAIL.Stanford.EDU (Tovar) writes:
>> 
>> In article <4521 at brl-adm.ARPA>, TVR%CCRMA-F4 at SAIL.Stanford.EDU writes:
>> >     In Algol 68 there is a provision for infinite precision arithmetic
>> >     (theoretically anyway--I don't know if anyone ever implemented such
>> >     a compiler). 
>
> Algol 68 has been running at the University of Alberta under the
> Michigan Terminal System (MTS) for a number of years. I do not
> know if other MTS sites are running it.
 
The compiler referred to is also available here at the University of
British Columbia under MTS. It (as far as I know) implements the full
Algol 68 language but it is a load-and-go compiler: it does not produce an
object deck. As far as infinite precision arithmetic goes, it uses the
following definition:
 
   if X is a type that occupies n bits, then LONG X occupies at least
   n bits.
 
On an IBM /370 architecture (the one that runs MTS), the hardware
supports integers that are 16 and 32 bits long. Thus, although you
can certainly tell the compiler that something is of type LONG INT,
it will be in fact only 32 bits long.
 
 laura halliday       ...ihnp4!alberta!ubc-vision!ubc-bdcvax!halliday  
 
 "I woke up in my apartment the other morning and everything had been  
 stolen and replaced with an exact replica!" - Max Headroom