Robert A Duff a �crit dans le message : wcchfhkxjeg.fsf@world.std.com... > I do. A fast language is one for which it is feasible to build > compilers that generate fast code. A slow language is one for which > that is not feasible. I pretty well understand that, but we are then talking about implementation in a compiler. > > Also I prefer to put the burden of proof on the language advocates -- > that is, a language should be considered "slow" until proven "fast" by > the existence of at least one good production-quality compiler. > > By this definition, Smalltalk, for example, is slow -- I've never seen a > Smalltalk compiler that can generate fast code. Furthermore, it seems Ok, we have never seen one, but is it really impossible ? I do remember something about IBM creating a Smalltalk compiler, is that true ? How fast was it ? > impossible, without doing all code generation at link time, which I > claim is not feasible in many cases. > > I don't know whether Fortran is faster than Ada at matrix multiplies, > but it does seem like a meaningful question to ask. If you measured This still seems a stange question to me! Certainly the algorithm used in the implementation as more to do with the speed than the language itself. Pascal. -- --|------------------------------------------------------------ --| Pascal Obry Team-Ada Member | --| | --| EDF-DER-IPN-SID- T T I | --| Intranet: http://cln46gb | --| Bureau N-023 e-mail: pascal.obry@edf.fr | --| 1 Av G�n�ral de Gaulle voice : +33-1-47.65.50.91 | --| 92141 Clamart CEDEX fax : +33-1-47.65.50.07 | --| FRANCE | --|------------------------------------------------------------ --| --| http://ourworld.compuserve.com/homepages/pascal_obry --| --| "The best way to travel is by means of imagination"