Transformation by interpreter specialisation
From MaRDI portal
Recommendations
Cited in
(19)- An investigation of Jones optimality and BTI-universal specializers
- A transformation-based optimiser for Haskell
- Imperative-program transformation by instrumented-interpreter specialization
- Compiler to interpreter: Experiences with a distributed programming language
- Specifying monogenetic specializers by means of a relation between source and residual programs
- Asymptotic speedups, bisimulation and distillation (work in progress)
- From Interpretation to Compilation
- Self-generating program specializers
- scientific article; zbMATH DE number 1522991 (Why is no real title available?)
- Annotation of logic programs for independent AND-parallelism by partial evaluation
- Solving non-linear Horn clauses using a linear Horn clause solver
- scientific article; zbMATH DE number 7453197 (Why is no real title available?)
- Call-pattern specialisation for Haskell programs
- Type specialisation for imperative languages
- Program Development in Computational Logic
- Static and dynamic program compilation by interpreter specialization
- Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation
- Runtime repeated recursion unfolding in CHR: a just-in-time online program optimization strategy that can achieve super-linear speedup
- How to control unfolding when specializing interpreters
This page was built for publication: Transformation by interpreter specialisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887680)
