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: 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


--- John Max Skaller <> 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
To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: