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