Ensuring the quasi-termination of needed narrowing computations
From MaRDI portal
(Redirected from Publication:845935)
Recommendations
- Termination of narrowing via termination of rewriting
- Fast and accurate strong termination analysis with an application to partial evaluation
- scientific article; zbMATH DE number 4205986
- scientific article; zbMATH DE number 14664
- Quantifier elimination in automatic loop parallelization
- A deterministic lazy narrowing calculus
- How to guarantee finite termination of verifying global optimization codes
- Improving the efficiency of non-deterministic computations
Cites work
- scientific article; zbMATH DE number 1332628 (Why is no real title available?)
- scientific article; zbMATH DE number 512892 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- A needed narrowing strategy
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Deforestation: Transforming programs to eliminate trees
- Fast narrowing-driven partial evaluation for inductively sequential programs
- Kernel-LEAF: A logic plus functional language
- Logic programming with functions and predicates: The language Babel
- Termination of rewriting
- The integration of functions into logic programming: From theory to practice
Cited in
(1)
This page was built for publication: Ensuring the quasi-termination of needed narrowing computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845935)