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
RE: [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 (10:33)
From: Mattias Waldau <mattias.waldau@a...>
Subject: RE: [Caml-list] @, List.append, and tail recursion
> wrote:
> > Thanks for the reference. I get nailed by this a couple of times a
> > year, and I usually just blame myself for being sloppy and recode 
> > all of my maps, appends, and filters to remove it. I think it would 

I agree that this is recurring problem, I myself often get bit by

It makes it very easy to make non-scalable program, works for input less
that 1000 elements, and the when applied to a large problem it fails
without a trace. It is very difficult to find the location of the
problem if you use the native compiler, and most of these programs
doesn't even work using the byte-code compiler.

So one of my coding guidelines is:
- do not use

I would like a prefer other solutions.


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