Inlining Semantics for Subroutines which are Recursive

Inlining Semantics for Subroutines which are Recursive (1992)

by Henry G. Baker

Venue:	ACM Sigplan Notices
Citations:	5 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Inlining Semantics for Subroutines which are Recursive	user correction - Legacy Corrections
AUTHOR NAME	Henry G. Baker	SVM HeaderParse 0.1
AUTHOR AFFIL	Nimble Computer Corporation	SVM HeaderParse 0.2
AUTHOR ADDR	16231 Meadow Ridge Way, Encino, CA 91436	SVM HeaderParse 0.1
ABSTRACT	Many modern programming languages offer a facility for "inlining" designated procedure and function calls, but this process is not well defined in most language standards documents. We offer a model for inlining which has the property that the resulting code does not depend upon the presentation of the order of function definitions, and which also provides a finite and consistent interpretation for the inlining of mutually recursive functions. Finally, when used on "tail-recursive" functions, our model of inlining provides for the equivalent of "loop unrolling". Introduction Many programming languages---e.g., Fortran, Ada, C++, Common Lisp---offer a facility for "macro-expanding" procedure and function calls, so that the operations of the procedure or function are performed "in line" with the other operations of the calling procedure rather than being performed "out of line" within a "closed" subroutine [Allen80] [Harrison77]. The goal of such an integration is to improve execution ...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	ACM Sigplan Notices	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	39--46	INFERENCE
VOLUME	27	INFERENCE
CITATIONS	18 found	ParsCit 1.0