Xref: utzoo comp.compilers:254 comp.theory:27
Path: utzoo!attcan!uunet!lll-winken!lll-lcc!lll-tis!helios.ee.lbl.gov!pasteur!ucbvax!decwrl!decvax!ima!compilers-sender
From: murthy@svax.cs.cornell.edu (Chet Murthy)
Newsgroups: comp.compilers,comp.theory
Subject: Call Graphs and Higher Order Functions
Keywords: optimization higher-order call-graphs
Message-ID: <1035@ima.ISC.COM>
Date: 23 May 88 19:55:01 GMT
Sender: compilers-sender@ima.ISC.COM
Reply-To: Chet Murthy <murthy@svax.cs.cornell.edu>
Organization: Cornell CS Dept
Lines: 11
Approved: compilers@ima.UUCP

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).

	--chet--
	murthy@svax.cs.cornell.edu
--
Send compilers articles to ima!compilers or, in a pinch, to Levine@YALE.EDU
Plausible paths are { ihnp4 | decvax | cbosgd | harvard | yale | bbn}!ima
Please send responses to the originator of the message -- I cannot forward
mail accidentally sent back to compilers.  Meta-mail to ima!compilers-request