Re: All languages are equally fit
- From: António Marques <m.ap@xxxxxxx>
- Date: Wed, 11 Nov 2009 17:08:07 +0000
DKleinecke wrote:
On Nov 10, 2:06 pm, hru...@xxxxxxxxxxxxxxxxxxxx (Herman Rubin) wrote:In article<cfef2492-e489-42dd-aeb9-765c3e7ce...@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
DKleinecke<dkleine...@xxxxxxxxx> wrote:On Nov 9, 9:46=A0am, hru...@xxxxxxxxxxxxxxxxxxxx (Herman Rubin) wrote:Also, it may be that the higher order assemblers of theCan you offer any examples of natural computer operations that have
type I suggest may make it possible to produce more
efficient Linux kernels in less time. =A0They provide
access to the operations which the current high level
languages do not, with many of the natural computer
operations no longer present in the language, so they
dropped out of the computers.
dropped out of computers because they are not accessible to current
high level languages? And any examples of how older high level
languages were better (the word "current' in paragraph aboive)?
High level languages rarely if ever, to my knowledge, had
these operations. Many of the early computers had division
giving an integer quotient and a remainder in one operation;
I have not seen that lately. Also, the separation of a
floating point number into exponent and mantissa, and the
converse production of floats. Fixed point (not integer)
arithmetic. Multiplication giving both the most and least
significant parts, both for fixed point and floating point
numbers. Unnormalized floating arithmetic. Boolean operations
on fixed point numbers, or on floating point.
--
This address is for information only. I do not claim that these views
are those of the Statistics Department or of Purdue University.
Herman Rubin, Department of Statistics, Purdue University
hru...@xxxxxxxxxxxxxxx Phone: (765)494-6054 FAX: (765)494-0558
Thank you the list.
As I read Herman, I think he was saying 'current' as opposed to 'future hypothetical', rather than to 'old'.
It seem to me that all of your examples are too hardware dependent to
be accomodated in a general purpose higher order language. The authors
of C would tell you that these are, because of the machine dependence,
more suitable for handling as subroutines than as operations of the
language. I would agree. You will find suitable subroutines in C
subroutine libraries.
I would disagree. It's awful that there's no way to both know the quotient and remainder with a single statement - not only clumsy, but it forces you to do the division twice (or do some other costly computation). And there is no way this can be adequately pushed to a library - unless, perhaps, the library is ASM, then you at least don't get extra penalties.
C relegated input-output to subroutines for the same reason and
thereby offended a great many people at the time it came out.
So far as I know all modern higher-order languages are descended from
C and share its attributes.
What?? Lisp, Smalltalk, Eiffel, Haskell, are descended from C?? (Rebol? Ruby? Javascript, even?)
.
- Follow-Ups:
- Re: All languages are equally fit
- From: DKleinecke
- Re: All languages are equally fit
- References:
- Re: All languages are equally fit
- From: DKleinecke
- Re: All languages are equally fit
- From: Herman Rubin
- Re: All languages are equally fit
- From: DKleinecke
- Re: All languages are equally fit
- From: Herman Rubin
- Re: All languages are equally fit
- From: DKleinecke
- Re: All languages are equally fit
- Prev by Date: Re: All languages are equally fit
- Next by Date: Re: All languages are equally fit
- Previous by thread: Re: All languages are equally fit
- Next by thread: Re: All languages are equally fit
- Index(es):
Relevant Pages
|