Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,661,415 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Compiler
Computation
Forth
History of compiler construction
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
XMG 2: Describing Description Languages
Simon Petitjean
,
D. Duchier
,
Y. Parmentier
Logical Aspects of Computational Linguistics
2016
Corpus ID: 10458743
This paper introduces XMGi¾ź2, a modular and extensible tool for various linguistic description tasks. Based on the notion of…
Expand
2014
2014
Supercompilation for Datatypes
Torben Æ. Mogensen
Ershov Memorial Conference
2014
Corpus ID: 1101030
Supercompilation is a method of transforming programs to obtain equivalent programs that perform fewer computation steps and…
Expand
2013
2013
Cryptographic Protocol Verification via Supercompilation (A Case Study)
Abdulbasit Ahmed
,
A. Lisitsa
,
A. Nemytykh
VPT@CAV
2013
Corpus ID: 5559420
It has been known for a while [35, 36, 12] that program transformation techniques, in particular, program specialization, can be…
Expand
2012
2012
A hierarchy of program transformers
G. Hamilton
2012
Corpus ID: 12585177
In this paper, we describe a hierarchy of program transformers in which the transformer at each level of the hierarchy builds on…
Expand
2011
2011
Improving supercompilation: tag-bags, rollback, speculation, normalisation, and generalisation
Maximilian Bolingbroke
,
S. Jones
2011
Corpus ID: 2879379
Supercompilation is a powerful technique for program optimisation and theorem proving. In this paper we describe and evaluate…
Expand
2010
2010
Towards Effective Two-Level Supercompilation
I. Klyuchnikov
2010
Corpus ID: 2709465
Towards effective two-level supercompilation Moscow 2010 Ilya Klyuchnikov. Towards effective two-level supercompilation The paper…
Expand
2010
2010
Strengthening supercompilation for call-by-value languages
Peter A. Jonsson
,
J. Nordlander
2010
Corpus ID: 69365245
A termination preserving supercompiler for a call-by-value language sometimes fails to remove intermediate structures that a…
Expand
2009
2009
SPSC : a Simple Supercompiler in Scala ?
I. Klyuchnikov
,
S. Romanenko
,
Andrei Klimov Keldysh
2009
Corpus ID: 14407878
class Term case class Var(name: String) extends Term case class CFG(kind: TKind.Value, name: String, args: List[Term]) extends…
Expand
2008
2008
Extracting Bugs from the Failed Proofs in Verification via Supercompilation
A. Lisitsa
2008
Corpus ID: 112991936
1997
1997
Partial Evaluation of Higher-order Natural-semantics Derivations
David A. SchmidtKansas
1997
Corpus ID: 14214096
We use on-line partial-evaluation technology to generate partial derivations from natural (big-step) semantics deenitions. First…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required