Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!sdd.hp.com!spool.mu.edu!news.nd.edu!mentor.cc.purdue.edu!pop.stat.purdue.edu!hrubin
From: hrubin@pop.stat.purdue.edu (Herman Rubin)
Newsgroups: comp.arch
Subject: Re: Compilers and efficiency
Message-ID: <10098@mentor.cc.purdue.edu>
Date: 11 Apr 91 14:17:56 GMT
References: <27fa3350.6bc2@petunia.CalPoly.EDU> <2803849F.483A@tct.com>
Sender: news@mentor.cc.purdue.edu
Lines: 25

In article <2803849F.483A@tct.com>, chip@tct.com (Chip Salzenberg) writes:
> According to hrubin@pop.stat.purdue.edu (Herman Rubin):
> >There is, at present, no language designed to take into account the collection
> >of "natural" useful hardware which the present users can find uses for, and
> >which are far more expensive in software than in hardware.
> 
> If Herman would write be so kind as to write a spec for such a
> language, we could try to implement it.
> 
> We're waiting, Herman...

1.  I am not quite sure what you mean by a spec.  If it is what I think it
is, it is far too early to do this.

2.  I am willing to provide a list of such instructions and their descriptions,
by no means intended to be complete, written in such a way that a reasonable
undergraduate (or even a high school student who can understand the idea of
mathematical symbolism and operations) with an understanding of binary
representation can understand.  Many of these have been posted to this group
by others as well as myself.  Such a list will include only those operations
of which I am acquainted, and others will come up with additional suggestions.
-- 
Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907-1399
Phone: (317)494-6054
hrubin@l.cc.purdue.edu (Internet, bitnet)   {purdue,pur-ee}!l.cc!hrubin(UUCP)