|Call Graphs and Higher Order Functions email@example.com (Chet Murthy) (1988-05-23)|
|From:||Chet Murthy <firstname.lastname@example.org>|
|Keywords:||optimization higher-order call-graphs|
|Date:||23 May 88 19:55:01 GMT|
|Organization:||Cornell CS Dept|
Does anybody know of work done on call graph estimation for
higher-order languages? Or even on imperative languages?
I am looking for work that followed up on the work of
Banning (I think that was the name).
Return to the
Search the comp.compilers archives again.