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] @, List.append, and tail recursion
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-01-31 (19:39)
From: Alexander V. Voinov <avv@q...>
Subject: Re: [Caml-list] @, List.append, and tail recursion
Hi All,

Russ Ross wrote:

>resources about this topic.  Right now I think there is some
>low-hanging fruit to be plucked--recognizing and transforming a few
>simple patterns (code that looks like would make a big
>difference in a lot of code.  Handling more complex cases is
>undoubtedly harder, but I think the potential benefits are
Yes, yes, yes. And this is a matter of adoption as well. Even if the 
global compiler strategy can't be changed quickly (to accomodate 
'futures' or 'holes' or whatever), let's just make the List module 
completely and absolutely tail recursive, one way or another. So that 
any newcomer can quickly map his/her favorite interative patterns of 
construction of homogeneous data structures (lists, arrays) to maps and 


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