The concept of a supercompiler
From MaRDI portal
Recommendations
Cited in
(49)- An improved reductant calculus using fuzzy partial evaluation techniques
- Annotated bibliography on partial evaluation and mixed computation
- On the transformation of logic programs with instantiation based computation rules
- Static semantics, types, and binding time analysis
- Extending a partial evaluator which supports separate compilation
- Constraint-based partial evaluation for imperative languages
- Reflection in conditional rewriting logic
- On one application of computations with oracle
- Higher-level supercompilation as a metasystem transition
- A formal development of an efficient supercombination compiler
- Verification as a parameterized testing (experiments with the SCP4 supercompiler)
- Closed-form upper bounds in static cost analysis
- scientific article; zbMATH DE number 1630107 (Why is no real title available?)
- Superoptimization in LLVM
- A regeneration scheme for generating extensions
- Horn clause solvers for program verification
- Proving properties of functional programs by equality saturation
- Supercompilation for Martin-Lof's type theory
- Interleaving symbolic execution and partial evaluation
- Inductive prover based on equality saturation for a lazy functional language
- Asymptotic speedups, bisimulation and distillation (work in progress)
- Certifying supercompilation for Martin-Löf's type theory
- Supercompilation for datatypes
- Multi-result supercompilation as branching growth of the penultimate level in metasystem transitions
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
- scientific article; zbMATH DE number 3943000 (Why is no real title available?)
- Refal
- A positive supercompiler
- Experience with the Super Monaco optimizing compiler
- scientific article; zbMATH DE number 1022228 (Why is no real title available?)
- Reverse universal resolving algorithm and inverse driving
- scientific article; zbMATH DE number 7453195 (Why is no real title available?)
- scientific article; zbMATH DE number 7453196 (Why is no real title available?)
- Rewriting techniques for program synthesis
- Proving the correctness of recursion-based automatic program transformations
- Rethinking supercompilation
- From standard to non-standard semantics by semantics modifiers
- Positive supercompilation for a higher order call-by-value language
- Polynomial-time inverse computation for accumulative functions with multiple data traversals
- The narrowing-driven approach to functional logic program specialization
- Program transformation system based on generalized partial computation
- The next 700 program transformers
- Excommunication: transforming \(\pi \)-calculus specifications to remove internal communication
- Program specialization as a tool for solving word equations
- Proving the correctness of recursion-based automatic program transformations
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation
- Essence of generalized partial computation
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
This page was built for publication: The concept of a supercompiler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3732942)
