Higher-level supercompilation as a metasystem transition

DOI10.1134/S0361768812050027zbMath1253.68088MaRDI QIDQ1758721

S. A. Romanenko, I. G. Klyuchnikov

Publication date: 16 November 2012

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

supercompilationbranching growth of the penultimate levelmetasystem transitions

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (3)

Supercompilation for Martin-Lof's type theory ⋮ Inductive Prover Based on Equality Saturation for a Lazy Functional Language ⋮ Certifying Supercompilation for Martin-Löf’s Type Theory

Uses Software

• Refal

Cites Work

• Unnamed Item
• Verification as a parameterized testing (experiments with the SCP4 supercompiler)
• Multi-result Supercompilation as Branching Growth of the Penultimate Level in Metasystem Transitions
• The concept of a supercompiler
• A positive supercompiler
• Equality saturation
• Positive supercompilation for a higher order call-by-value language

This page was built for publication: Higher-level supercompilation as a metasystem transition