The following pages link to The concept of a supercompiler (Q3732942):
Displaying 37 items.
- Refal (Q39349) (← links)
- A regeneration scheme for generating extensions (Q290228) (← links)
- Proving properties of functional programs by equality saturation (Q300342) (← links)
- Supercompilation for Martin-Lof's type theory (Q300348) (← links)
- Reverse universal resolving algorithm and inverse driving (Q444478) (← links)
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- Proving the correctness of recursion-based automatic program transformations (Q671683) (← links)
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation (Q739638) (← links)
- Essence of generalized partial computation (Q808278) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
- An improved reductant calculus using fuzzy partial evaluation techniques (Q1037854) (← links)
- Annotated bibliography on partial evaluation and mixed computation (Q1104069) (← links)
- On the transformation of logic programs with instantiation based computation rules (Q1119029) (← links)
- Static semantics, types, and binding time analysis (Q1179698) (← links)
- Extending a partial evaluator which supports separate compilation (Q1583351) (← links)
- Constraint-based partial evaluation for imperative languages (Q1599645) (← links)
- Reflection in conditional rewriting logic (Q1608918) (← links)
- On one application of computations with oracle (Q1758675) (← links)
- Higher-level supercompilation as a metasystem transition (Q1758721) (← links)
- Verification as a parameterized testing (experiments with the SCP4 supercompiler) (Q2371554) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Horn Clause Solvers for Program Verification (Q2947164) (← links)
- Interleaving Symbolic Execution and Partial Evaluation (Q3066122) (← links)
- Inductive Prover Based on Equality Saturation for a Lazy Functional Language (Q3455064) (← links)
- Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) (Q3455068) (← links)
- Certifying Supercompilation for Martin-Löf’s Type Theory (Q3455070) (← links)
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION (Q3526545) (← links)
- A positive supercompiler (Q4339016) (← links)
- (Q4339951) (← links)
- (Q5020656) (← links)
- (Q5020657) (← links)
- Rewriting techniques for program synthesis (Q5055734) (← links)
- Proving the correctness of recursion-based automatic program transformations (Q5096758) (← links)
- FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS (Q5249253) (← links)
- The narrowing-driven approach to functional logic program specialization (Q5957056) (← links)
- Program transformation system based on generalized partial computation (Q5957059) (← links)
