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] Generating C stubs
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: John Max Skaller <skaller@o...>
Subject: Re: [Caml-list] Tail recursion detection
Noel Welsh wrote:

>I think you're confusing tail calls with closure
Yes. Seems to me that there's no point detecting
tail calls if you don't achieve constant storage overhead,
so I identified the two concepts. Sorry, my mistake.

>Closure conversion determines which
>closures can stack allocated, done away with, or must
>be heap allocated.  There are simple ways and complex
>way to do this. 
Yes. What I need is something that will "undo" some of
my syntactic sugaring. If it is too hard, I will be forced
to complicate the compiler by adding extra terms to retain
the required information (which is don't like much,
since I just eliminated them .. :)

Thanks for the references!

John Max Skaller,
snail:10/1 Toxteth Rd, Glebe, NSW 2037, Australia.

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