Article

Free access

Procedure linkage optimization working paper

Authors:

A. Maggiolo-Schettini,

H. R. StrongAuthors Info & Claims

POPL '73: Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Pages 183 - 193

https://doi.org/10.1145/512927.512944

Published: 01 October 1973 Publication History

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.

References

[1]

Constable, R. L. and Gries, D., On classes of program schemata. SIAM J. Computing 1 (1972), 66-118.

[2]

Culik, K., A model for the formal definition of programming languages. CSRR 2065, Dept. of Appl. Analysis and Computer Sci., U. of Waterloo, Waterloo, Ont., June, 1972.

[3]

Denning, P. J., Virtual memory. Computing Surveys 2 (1970), 153-189.

Digital Library

[4]

Ingerman, P. Z., Thunks. Comm. ACM 4 (1961), 55-58.

Digital Library

[5]

Irons, E. T. and Feurzig, W., Comments on the implementation of recursive procedures and blocks in ALGOL 60. Comm. ACM 4 (1961), 65-69.

Digital Library

[6]

Johnston, J. B., The contour model of block structured processes, SIGPLAN Notices 6 (February, 1971), 52-82.

Digital Library

[7]

Maggiolo-Schettini, A. and Strong, H. R., A graph-theoretic algorithm with applications for transforming recursive programs. AICA Convegno di Informatica Teoria, Pisa, March, 1973.

[8]

Naur, P. (Ed.), Revised report on the algorithmic language ALGOL 60. Comm. ACM 6 (1963), 1-17.

Digital Library

[9]

Parnas, D. L., On the criteria to be used in decomposing systems into modules. Comm. ACM 15 (1972), 1053-1058.

Digital Library

[10]

Rosen, B. K., Tree-manipulating systems and Church-Rosser theorems. J.ACM 20 (1973), 160-187.

Digital Library

[11]

Strong, H. R., Translating recursion equations into flowcharts. JCSS 5 (1971), 254-285.

Digital Library

[12]

Walker, S. A. and Strong, H. R., Characterization of flowchartable recursions. JCSS (to appear).

Digital Library

[13]

Wegner, P., The Vienna definition language. Computing Surveys 4 (1972), 5-63.

Digital Library

[14]

Wirth, N., and Hoare, C. A. R., A contribution to the development of ALGOL. CACM 9 (1966), 413-431.

Digital Library

[15]

Wirth, N., and Weber, H., EULER: a generalization of ALGOL, and its formal definition. CACM 9 (1966), 13-25 and 89-99.

Digital Library

[16]

Wulf, W., et al., Bliss/11 Reference Manual. Computer Science Department, Carnegie-Mellon University, Pittsburgh, Penn., March, 1972. {See also BLISS: a language for systems programming, CACM 14 (1971), 780-790.}

Digital Library

Cited By

Maggiolo-Schettini ANapoli MTortora G(1988)Web StructuresIEEE Transactions on Software Engineering10.1109/32.905014:11(1621-1639)Online publication date: 1-Nov-1988
https://dl.acm.org/doi/10.1109/32.9050
Auslander MStrong H(1978)Systematic recursion removalCommunications of the ACM10.1145/359340.35934421:2(127-134)Online publication date: 1-Feb-1978
https://dl.acm.org/doi/10.1145/359340.359344
Rosen B(1977)High-level data flow analysisCommunications of the ACM10.1145/359842.35984920:10(712-724)Online publication date: 1-Oct-1977
https://dl.acm.org/doi/10.1145/359842.359849
Show More Cited By

Procedure linkage optimization working paper
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages

Recommendations

Linkage artificial bee colony for solving linkage problems

A novel optimization method.Evaluate using Pott model problems and linkage functions.Outperform the current methods. Nature-inspired meta-heuristics have gained popularity for the solution of many real world complex problems, and the artificial bee ...
Particle Swarm Optimization With Recombination and Dynamic Linkage Discovery

In this paper, we try to improve the performance of the particle swarm optimizer by incorporating the linkage concept, which is an essential mechanism in genetic algorithms, and design a new linkage identification technique called dynamic linkage ...
Interlanguage working without tears: blending SML with Java
ICFP '99: Proceedings of the fourth ACM SIGPLAN international conference on Functional programming

A good foreign-language interface is crucial for the success of any modern programming language implementation. Although all serious compilers for functional languages have some facility for interlanguage working, these are often limited and awkward to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '73: Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages

October 1973

242 pages

ISBN:9781450373494

DOI:10.1145/512927

Conference Chair:
Patrick C. Fischer
University of Waterloo, Waterloo, Ontario, Canada
,
Program Chair:
Jeffrey D. Ullman
Princeton University, Princeton, NJ 08540

Copyright © 1973 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1973

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

POPL '73 Paper Acceptance Rate 22 of 100 submissions, 22%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
294
Total Downloads

Downloads (Last 12 months)49
Downloads (Last 6 weeks)8

Reflects downloads up to 21 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Maggiolo-Schettini ANapoli MTortora G(1988)Web StructuresIEEE Transactions on Software Engineering10.1109/32.905014:11(1621-1639)Online publication date: 1-Nov-1988
https://dl.acm.org/doi/10.1109/32.9050
Auslander MStrong H(1978)Systematic recursion removalCommunications of the ACM10.1145/359340.35934421:2(127-134)Online publication date: 1-Feb-1978
https://dl.acm.org/doi/10.1145/359340.359344
Rosen B(1977)High-level data flow analysisCommunications of the ACM10.1145/359842.35984920:10(712-724)Online publication date: 1-Oct-1977
https://dl.acm.org/doi/10.1145/359842.359849
Rosen B(1975)Deriving graphs from graphs by applying a productionActa Informatica10.1007/BF002896164:4(337-357)Online publication date: 1-Dec-1975
https://dl.acm.org/doi/10.1007/BF00289616

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents