Skip to main content
Log in

Program transformation through meta-shifting

  • Short Notes
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

A program transformation strategy called meta-shifting is developed for control optimization of programs written in languages with control freedom. The strategy involves writing a specialized evaluator for each program (segment) with specific control. It is applied to an equational language to derive a general method to transform one program into another, which simulates (approximately) normal order evaluation of the original program, under interpreters with arbitrary evaluation order.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Gallagher, J.: Simulating Corouting for the 8 Queens Problem Logic Programming Newsletter,No. 3 (1982) 10.

    Google Scholar 

  2. Hoffmann, C. M. and O’Donnell, M. J.: Programming with Equations, ACM TOPLAS,4-1 (1982) 83.

    Article  Google Scholar 

  3. Huet, G.: Confluent Reduction: abstract properties and application to term rewriting systems, J. ACM,27-4 (1980) 797.

    Article  MathSciNet  Google Scholar 

  4. Ono, K.: Selectively Delayed Evaluation through Program Transformation, J. Inform. Process.,5-4 (1982) 223.

    Google Scholar 

  5. Steele, G. L., Jr: RABBIT: a Compiler for SCHEME, MIT AI Memo,474 (1978).

  6. Wand, M.: Continuation based program transformation stragegies, J. ACM,27-1 (1980) 164.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

About this article

Cite this article

Tamaki, H., Sato, T. Program transformation through meta-shifting. NGCO 1, 93–98 (1983). https://doi.org/10.1007/BF03037026

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037026

Keywords

Navigation