Version française
Home     About     Download     Resources     Contact us    
Browse thread
Re: [Caml-list] Reporting on sucess/failure of tail recursion
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Andres Varon <avaron@g...>
Subject: Re: [Caml-list] Reporting on sucess/failure of tail recursion
While exploring the (undocumented) options of ocamlopt I discovered  
once that -dlinear explicitly says if a function is a tailcall or  
not. It has worked consistently for me whenever I needed to check  
this afterwards.

Andres

On Dec 2, 2005, at 7:28 PM, David Thomas wrote:

> Particularly with respect to list operations,
> "non-tail-recursive" usually implies stack space used
> is O(n) to the length of the list, whereas "tail
> recursive" implies O(1).  I, for one, would love to
> see these figures explicitly, instead.
>
> --- skaller <skaller@users.sourceforge.net> wrote:
>
>> What needs to be documented for a library function
> is its
>> complexity (time/space etc). In this sense the
> documentation
>> of the C++ Standard Library should be taken as an
> examplar.
>
>
>
> 		
> __________________________________
> Start your day with Yahoo! - Make it your home page!
> http://www.yahoo.com/r/hs
>
> _______________________________________________
> Caml-list mailing list. Subscription management:
> http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
> Archives: http://caml.inria.fr
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs