The following pages link to A positive supercompiler (Q4339016):
Displaying 18 items.
- Proving properties of functional programs by equality saturation (Q300342) (← links)
- Reverse universal resolving algorithm and inverse driving (Q444478) (← links)
- Partial evaluation of Maple (Q532411) (← links)
- On obtaining the Boyer-Moore string-matching algorithm by partial evaluation (Q845710) (← links)
- An investigation of Jones optimality and BTI-universal specializers (Q1029807) (← links)
- Higher-level supercompilation as a metasystem transition (Q1758721) (← links)
- A residualizing semantics for the partial evaluation of functional logic programs. (Q1853170) (← links)
- Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- Maximally-Polyvariant Partial Evaluation in Polynomial Time (Q3179173) (← 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)
- (Q5020657) (← 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)
