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 (12:44) |
From: | Noel Welsh <noelwelsh@y...> |
Subject: | Re: [Caml-list] Tail recursion detection |
I think you're confusing tail calls with closure conversion. 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. Some references: Orbit, Kranz et al 'Control Flow Analysis: A compilation paradigm for functional langauge' Manuel Serrano 'Flow-directed Lighweight Closure Conversion' by the guy who does the Stalin scheme compiler 'Lightweight Closure Conversion' Paul Steckler and Mitchell Wand. Google or CiteSeer with find the above and a zillion more. HTH, Noel --- John Max Skaller <skaller@ozemail.com.au> wrote: > Perhaps I'm confused, but .. > The problem isn't replacing calls with jumps, > but identifying which closure to reuse. In general, > that is impossible without dataflow analysis. __________________________________________________ Do You Yahoo!? LAUNCH - Your Yahoo! Music Experience http://launch.yahoo.com ------------------- 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