Maximally-polyvariant partial evaluation in polynomial time
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1254023
- A hybrid approach to online and offline partial evaluation
- Topics in semantics-based program manipulation
- Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency
- scientific article; zbMATH DE number 1948415
Cites work
- scientific article; zbMATH DE number 4101166 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- scientific article; zbMATH DE number 3403734 (Why is no real title available?)
- A note on linear time simulation of deterministic two-way pushdown automata
- A positive supercompiler
- A practical simulation result for two-way pushdown automata
- A simulation result for two-way pushdown automata
- Fast Pattern Matching in Strings
- Model checking procedural programs
- On the partial computation principle
- Parsing Techniques
- Polyvariant mixed computation for analyzer programs
- Program transformation system based on generalized partial computation
- Time and tape complexity of pushdown automaton languages
Cited in
(3)
This page was built for publication: Maximally-polyvariant partial evaluation in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179173)