* call graphs
@ 2005-02-07 15:57 skaller
0 siblings, 0 replies; only message in thread
From: skaller @ 2005-02-07 15:57 UTC (permalink / raw)
To: caml-list
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, mailto:skaller@users.sf.net
voice: 061-2-9660-0850,
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language http://felix.sf.net
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2005-02-07 15:57 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2005-02-07 15:57 call graphs skaller
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).