Skip to search formSkip to main contentSkip to account menu

Metacompilation

Known as: Meta-Compilation, Supercompilation 
Metacompilation is a computation which involves metasystem transitions (MST) from a computing machine M to a metamachine M' which controls, analyzes… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This paper introduces XMGi¾ź2, a modular and extensible tool for various linguistic description tasks. Based on the notion of… 
2014
2014
Supercompilation is a method of transforming programs to obtain equivalent programs that perform fewer computation steps and… 
2013
2013
It has been known for a while [35, 36, 12] that program transformation techniques, in particular, program specialization, can be… 
2012
2012
In this paper, we describe a hierarchy of program transformers in which the transformer at each level of the hierarchy builds on… 
2011
2011
Supercompilation is a powerful technique for program optimisation and theorem proving. In this paper we describe and evaluate… 
2010
2010
Towards effective two-level supercompilation Moscow 2010 Ilya Klyuchnikov. Towards effective two-level supercompilation The paper… 
2010
2010
A termination preserving supercompiler for a call-by-value language sometimes fails to remove intermediate structures that a… 
2009
2009
class Term case class Var(name: String) extends Term case class CFG(kind: TKind.Value, name: String, args: List[Term]) extends… 
1997
1997
We use on-line partial-evaluation technology to generate partial derivations from natural (big-step) semantics deenitions. First…