Fast narrowing-driven partial evaluation for inductively sequential programs
From MaRDI portal
Publication:2936786
Recommendations
- scientific article; zbMATH DE number 3868611
- Constraint-based partial evaluation for imperative languages
- Optimized program extraction for induction and coinduction
- Efficient program synthesis using constraint satisfaction in inductive logic programming
- Recursive program optimization through inductive synthesis proof transformation
- Fast offline partial evaluation of logic programs
- Fast and accurate strong termination analysis with an application to partial evaluation
- Forward slicing of multi-paradigm declarative programs based on partial evaluation
Cited in
(11)- scientific article; zbMATH DE number 3868611 (Why is no real title available?)
- Termination of Narrowing in Left-Linear Constructor Systems
- Conversion to tail recursion in term rewriting
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
- The narrowing-driven approach to functional logic program specialization
- Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
- Ensuring the quasi-termination of needed narrowing computations
- Termination of narrowing via termination of rewriting
- scientific article; zbMATH DE number 2032417 (Why is no real title available?)
- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
This page was built for publication: Fast narrowing-driven partial evaluation for inductively sequential programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936786)