Browse thread
[Caml-list] Generating C stubs
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2002-05-22 (16:47) |
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 >conversion. > 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, mailto:skaller@ozemail.com.au snail:10/1 Toxteth Rd, Glebe, NSW 2037, Australia. voice:61-2-9660-0850 ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners