I thinks it's very difficult to outperform C since C really is just about at the level of assembly language.
To beat C I think you would have to write a better compiler. It wouldn't be about the language but about the compiler. I'm sure a really good language compiler can already beat a crappy C compiler. I think the right approach to a language faster than C is to simply write a better C that is specifically designed to have more opportunities for optimization. D is a language that claims to have this, but it is still well behind C in the performance of the resulting executables. I really don't think a truly higher level language will ever beat C or a performance improved C. There is some hope that a JIT can do some optimizations not possible with a static compiler - but even if this is the case C could follow this path too. I noticed that GCC already supports optimizations that involve profiling the code FIRST so that a second compiler pass can be smarter. - Don Álvaro Begué wrote: > > > On Dec 12, 2007 2:32 PM, Stefan Nobis <[EMAIL PROTECTED] > <mailto:[EMAIL PROTECTED]>> wrote: > > [...] and sometime it's even possible to outperform C code. > > > I just don't believe this. I propose a simple experiment to see who is > right. You pick a simple algorithm which you claim Lisp can run > faster, you propose the fastest Lisp implementation that you can think > of, I'll propose the fastest C implementation that I can think of and > we'll compare. Are you in? > > Álvaro. > > > > ------------------------------------------------------------------------ > > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
