Techniques for partial evaluation of imperative languages

25Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Various techniques for the partial evaluation of imperative programs with subroutines and possible side-effects are presented. They cover dynamic annotations, a new polyvariant computation scheme, specialization of procedures and functions including call-by-result and call-by-reference parameters. Preprocessing is applied to compute the callgraph and information about the occurrences of global variables. We use an abstract interpretation technique for postprocessing, which is used to eliminate unnecessary assignments and to determine the variables which have to be declared. The language related to the partial evaluator is a subset of Pascal with some minor changes. © 1991, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Meyer, U. (1991). Techniques for partial evaluation of imperative languages. ACM SIGPLAN Notices, 26(9), 94–105. https://doi.org/10.1145/115866.115876

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free