Journal article

Correctness of on-line partial evaluation for a Pascal-like language


Authors listMeyer, U

Publication year1999

Pages55-73

JournalScience of Computer Programming

Volume number34

Issue number1

ISSN0167-6423

DOI Linkhttps://doi.org/10.1016/S0167-6423(98)00015-X

PublisherElsevier


Abstract
An on-line partial evaluator for an imperative language is formally defined and proven to be correct. As far as we know, this is the first correctness proof of an on-line partial evaluator. The proof consists of several lemmata showing the correctness of partial evaluation of expression and the invariance of certain properties of the environments under partial/residual and total evaluation. The language the partial evaluator is based, on contains functions as well as procedures with value, result, and reference parameters and side-effects. (C) 1999 Published by Elsevier Science B.V. All rights reserved.



Citation Styles

Harvard Citation styleMeyer, U. (1999) Correctness of on-line partial evaluation for a Pascal-like language, Science of Computer Programming, 34(1), pp. 55-73. https://doi.org/10.1016/S0167-6423(98)00015-X

APA Citation styleMeyer, U. (1999). Correctness of on-line partial evaluation for a Pascal-like language. Science of Computer Programming. 34(1), 55-73. https://doi.org/10.1016/S0167-6423(98)00015-X



Keywords


binding-time analysiscorrectnesspartial evaluation

Last updated on 2025-02-04 at 06:51