Procedure linkage optimization working paper

Authors:
A. Maggiolo-Schettini;B. K. Rosen;H. R. Strong
Affiliations:
Laboratorio di Cibernetica, 80072 Arco Felice, ITALY;IBM Thomas J. Watson Research Center, Yorktown Heights, New York;IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Venue:
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1973

Citing 12
Cited 3

Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Virtual Memory

ACM Computing Surveys (CSUR)
The Vienna Definition Language

ACM Computing Surveys (CSUR)
On the criteria to be used in decomposing systems into modules

Communications of the ACM
BLISS: a language for systems programming

Communications of the ACM
EULER: a generalization of ALGOL, and its formal definition: Part II

Communications of the ACM
A contribution to the development of ALGOL

Communications of the ACM
Thunks: a way of compiling procedure statements with some comments on procedure declarations

Communications of the ACM
Comments on the implementation of recursive procedures and blocks in ALGOL 60

Communications of the ACM
Revised report on the algorithm language ALGOL 60

Communications of the ACM
The contour model of block structured processes

ACM SIGPLAN Notices
Characterizations of flowchartable recursions

Journal of Computer and System Sciences

Web Structures: A Tool for Representing and Manipulating Programs

IEEE Transactions on Software Engineering
Systematic recursion removal

Communications of the ACM
High-level data flow analysis

Communications of the ACM

Quantified Score

Hi-index	0.03

Visualization

Abstract

This paper discusses the desirability of procedure linkage optimization and sketches a general theory of interpretive semantics which is motivated by technical problems in specifying and validating program transformations that optimize procedure linkages. One particular transformation is treated in detail.Recursive ALGOL 60 procedures sometimes pass parameters by name in such a way that the general thunk mechanism is unnecessary and inefficient. We present an optimization which detects this kind of call-by-name and implements it thunklessly. We prove that the transformation preserves semantics and we discuss the effect on running time and memory management.