Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/5/84; site rpics.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!seismo!rpics!weltyrp
From: weltyrp@rpics.UUCP (Richard Welty)
Newsgroups: net.lang.c
Subject: Re: Falsies
Message-ID: <179@rpics.UUCP>
Date: Sun, 8-Sep-85 21:30:40 EDT
Article-I.D.: rpics.179
Posted: Sun Sep  8 21:30:40 1985
Date-Received: Wed, 11-Sep-85 08:34:50 EDT
References: <1288@brl-tgr.ARPA>
Organization: RPI CS Department, Troy  NY
Lines: 26

> Now about the Burrough's. What exactly is their idea of truth? I hear
> rumors that some of their machines are programmed in ALGOL. Is this
> some kind of higher level concept? What's, uh, the deal?
> 
>... 
> 	jim		cottrell@nbs
>
The way Burroughs implements truth is quite immaterial, as there is no
assembler.  The Burroughs stack machines are programmed in a language that
directly supports Burroughs Extended Algol, and all systems programs on such
machines are written in the Burroughs dialect.  Boolean is a real datatype
supported by the hardware.  In fact, every high level concept from Algol is
supported in the hardware.  Strong typing is even supported in the hardware.
The machines attach type bits to each unit of memory.  The machines are
quite interesting, really, although they were commercially not massively
successful.
-- 
				Rich Welty

	(I am both a part-time grad student at RPI and a full-time
	 employee of a local CAE firm, and opinions expressed herein
	 have nothing to do with anything at all)

	CSNet:   weltyrp@rpi
	ArpaNet: weltyrp.rpi@csnet-relay
	UUCP:  seismo!rpics!weltyrp