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
call graphs
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2005-02-07 (15:57)
From: skaller <skaller@u...>
Subject: call graphs
Does anyone know of any online basic material on
call/usage graphs and their relation to child trees?

In particular, I not sure how to do exhaustive inlining,
where exhaustive means every call is either to a primitive,
or to a directly nontail recursive function.

John Skaller,
voice: 061-2-9660-0850, 
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language