Related articles |
---|
[4 earlier articles] |
Re: Separating algorithms from implementations (long) joachim_d@gmx.de (Joachim Durchholz) (2000-09-08) |
Re: Separating algorithms from implementations (long) toon@moene.indiv.nluug.nl (Toon Moene) (2000-09-08) |
Re: Separating algorithms from implementations (long) dara_gallagher@my-deja.com (Dara Gallagher) (2000-09-09) |
Re: Separating algorithms from implementations (long) jthorn@galileo.thp.univie.ac.at (2000-09-09) |
Re: Separating algorithms from implementations (long) dara_gallagher@my-deja.com (Dara Gallagher) (2000-09-13) |
Re: Separating algorithms from implementations (long) fjh@cs.mu.OZ.AU (2000-09-13) |
Re: Separating algorithms from implementations (long) nr@labrador.eecs.harvard.edu (2000-09-23) |
From: | nr@labrador.eecs.harvard.edu (Norman Ramsey) |
Newsgroups: | comp.graphics.algorithms,comp.compilers,comp.dsp |
Date: | 23 Sep 2000 14:52:20 -0400 |
Organization: | Harvard University |
References: | 00-08-124 00-09-072 |
Keywords: | design, functional |
Dara Gallagher <dara_gallagher@my-deja.com> wrote:
>Also, I remember hearing (from at least 10 years ago) claims to the
>effect that the high-level and abstract nature of modern functional
>programming languages (i.e. after ML) would allow compilers to
>perform highly extensive optimization which would be impossible
>with imperative languages. Unfortunately these "wonder compilers"
>still haven't appeared.
True, but functional languages are still plenty fast. At the most
recent contest, the problem was to write a ray tracer, which you would
think C programs would be good at. But the fastest ray tracer (which
was 3x as fast as #2 and 9x as fast as #3) was written in the
Objective Caml dialect of ML. None of the C or C++ entries (9 of 39)
finished in the top 4 for speed. So there are pretty good ML
compilers out there.
Norman
Return to the
comp.compilers page.
Search the
comp.compilers archives again.