Inline expansion of SETL procedures

Authors:
Kio C. Hyun;Ernst-Erich Doberkat
Affiliations:
Institut für Informatik, Hochschule Hildesheim, Marienburger Platz 22, D-3200 Hildesheim, West Germany;Institut für Informatik, Hochschule Hildesheim, Marienburger Platz 22, D-3200 Hildesheim, West Germany
Venue:
ACM SIGPLAN Notices
Year:
1985

Citing 4
Cited 1

Programming by Refinement, as Exemplified by the SETL Representation Sublanguage

ACM Transactions on Programming Languages and Systems (TOPLAS)
Experience with the SETL Optimizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
An analysis of inline substitution for a structured programming language

Communications of the ACM
Macroprocessors and Techniques for Portable Software

Macroprocessors and Techniques for Portable Software

Inlining semantics for subroutines which are recursive

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report on an experiment in doing inline expansion of SETL procedures using the prototype of a preprocessor written in Franz LISP. This expansion facilitates in particular data flow analysis and enhances the quality of information which is available to the typefinding phase of the SETL optimizer.