Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Does Caml have slow arithmetics ?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2004-07-08 (03:45)
From: David Brown <caml-list@d...>
Subject: Re: [Caml-list] Does Caml have slow arithmetics ?
On Thu, Jul 08, 2004 at 05:16:19AM +1000, skaller wrote:
> On Thu, 2004-07-08 at 00:58, Xavier Leroy wrote:
> > On the other hand, reducing inefficiencies already present in the
> > source code isn't a priority.  
> Of course that argument fails totally in one important
> case -- Q: if you wanted a loop why didn't you use one?
> A: tail-rec functional code is considered cute :)

In some functional languages (Scheme, specifically), tail recursion is
required to be implemented iteratively.  It is a common enough idiom,
and easy enough to implement, that it is generally done in functional
languages.  In fact, gcc does it in C, with enough optimization.


To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: