Ensuring the quasi-termination of needed narrowing computations
From MaRDI portal
Publication:845935
DOI10.1016/J.IPL.2006.09.010zbMATH Open1184.68165OpenAlexW2149745386MaRDI QIDQ845935FDOQ845935
Authors: J. Guadalupe Ramos, Josep Silva, Germán Vidal 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.09.010
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
- Logic programming with functions and predicates: The language Babel
- Termination of rewriting
- Title not available (Why is that?)
- Deforestation: Transforming programs to eliminate trees
- A needed narrowing strategy
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Kernel-LEAF: A logic plus functional language
- The integration of functions into logic programming: From theory to practice
- Fast narrowing-driven partial evaluation for inductively sequential programs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
Uses Software
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)
