[clean-list] Speed of native code

Scott J. jscott@planetinternet.be
Thu, 4 Jul 2002 14:21:52 +0200


I shall dig in it. Hopely these are not the old benchmarks I have already
seen 2 years ago.. AFAIK Ocamel was nr. 1 with their implementation of FFT.
Can a lazy language give fast native code.
Thx for the tip.

Cheers

Jan
----- Original Message -----
From: "Fabien Todescato" <f.todescato@larisys.fr>
To: "'Scott J.'" <jscott@planetinternet.be>
Cc: "Clean mailing list (Adresse de messagerie)" <clean-list@cs.kun.nl>
Sent: Thursday, July 04, 2002 1:50 PM
Subject: RE: [clean-list] Speed of native code


> Some times ago there was quite a debate about the relative efficiency of
> Fast Fourier Transforms implemented in Clean and various other languages.
> You may want to dig in the mailing list archive for the details.
>
> Cheers, Fabien
>
> > -----Message d'origine-----
> > De: Scott J. [SMTP:jscott@planetinternet.be]
> > Date: jeudi 4 juillet 2002 13:42
> > À: Clean-list
> > Objet: Fw: [clean-list] Speed of native code
> >
> > Hello,
> >
> > I wanted to hear if some benchmarks have been done with Clean.
> > The most serious contender in FP is I think Ocamel. It seems to me that
> > Ocamel compiles to fast native code , much faster than e.g. Haskell.
> > So, what about Clean?
> >
> > Cheers
> >
> > Jan and sorry for the typo's
> >
> >
> > ----- Original Message -----
> > From: Jan Brosius <mailto:jscott@planetinternet.be>
> > To: Clean-list <mailto:clean-list@cs.kun.nl>
> > Sent: Thursday, July 04, 2002 2:34 AM
> > Subject: [clean-list] Speed of native code
> >
> > Hello,
> >
> > Iwanted to hear if some benchmarks have been done with Clean.
> > The most serious contender in is I think Ocamel. Itmseems that Ocamel
> > compile to fast native code , much faster than e.g. Haskell.
> > So, what about Clean?
> >
> > Cheers
> >
> > Jan
>
> _______________________________________________
> clean-list mailing list
> clean-list@cs.kun.nl
> http://www.cs.kun.nl/mailman/listinfo/clean-list
>