Metacompilation

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Metacompilation is a computation which involves metasystem transitions (MST) from a computing machine M to a metamachine M' which controls, analyzes and imitates the work of M. Semantics-based program transformation, such as partial evaluation and supercompilation (SCP), is metacomputation. Metasystem transitions may be repeated, as when a program transformer gets transformed itself. In this manner MST hierarchies of any height can be formed. The Fox[clarification needed] paper reviews one strain of research which was started in Russia by Valentin Turchin's REFAL system in the late 1960s-early 1970s and became known for the development of supercompilation as a distinct method of program transformation. After a brief description of the history of this research line, the paper concentrates on those results and problems where supercompilation is combined with repeated metasystem transitions.

See also

External links

  • Meta Compilation in Forth programming language by Jeff Fox, UltraTechnology
  • Papers on metacompilation
  • Metacomputation: Metasystem Transitions + Supercompilation an introduction to supercompilation
Retrieved from "https://en.wikipedia.org/w/index.php?title=Metacompilation&oldid=857957797"
This content was retrieved from Wikipedia : http://en.wikipedia.org/wiki/Metacompilation
This page is based on the copyrighted Wikipedia article "Metacompilation"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA