From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!news.unit0.net!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: Niklas Holsti <niklas.holsti@tidorum.invalid>
Newsgroups: comp.lang.ada
Subject: Re: Hardware Design supporting Ada
Date: Sun, 11 Dec 2016 23:15:16 +0200
Organization: Tidorum Ltd
Message-ID: <eb5tv4Fnk5kU1@mid.individual.net>
References: <f0073c86-c957-4186-bc3a-70ae37f22c5c@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: individual.net vp9cKlti5+hBjJUU1NAAegKkIkVfTZIwswWpbxpplFAzRNSBqq
Cancel-Lock: sha1:uBlXABIYiToCkkT4tKRXW854WaI=
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:45.0)
 Gecko/20100101 Thunderbird/45.5.1
In-Reply-To: <f0073c86-c957-4186-bc3a-70ae37f22c5c@googlegroups.com>
Xref: news.eternal-september.org comp.lang.ada:32731
Date: 2016-12-11T23:15:16+02:00
List-Id: <comp.lang.ada>

On 16-12-11 22:55 , Shark8 wrote:
> In the Ada IR thread an interesting sub-discussion regarding
> specialized hardware came up; some of the HW mentioned were:
> * The Rational R-1000
   ...
> * The Intel iAPX 432
    ...
> * The Rekursiv

Did they mention the Nokia MPS-10:

http://dl.acm.org/citation.cfm?id=989799&dl=ACM&coll=DL&CFID=874929794&CFTOKEN=55213355

http://computer-programming-forum.com/44-ada/596b4e2f57763ce6.htm

> In addition to this, I've been doing some work looking into
> balanced-ternary computers ...
 > Further, [balanced] ternary provides some interesting properties;
 > if,for example, we define {1, 0, -1} as {greater-than, equal,
 > less-than} respectively then we can have a JUMP instruction
 > that takes this single Trit comparison result and three offsets
 > and take care of ALL the JUMP combinations in binary instruction
 > -sets with one instruction.

Then you will be able to implement the original FORTRAN "arithmetic 
IF-statement" very efficiently, it being of the form

    IF (expr) 100, 200, 300

which would pass control to the label 100 if the expression in the 
parenthesis is negative, to 200 if it is zero, and to 300 if it is positive.

However, I don't see how such an instruction would help Ada, in particular.

-- 
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
       .      @       .