Pages that link to "Item:Q944383"
From MaRDI portal
The following pages link to Loop detection in term rewriting using the eliminating unfoldings (Q944383):
Displaying 7 items.
- Loop detection by logically constrained term rewriting (Q1629968) (← links)
- Lower bounds for runtime complexity of term rewriting (Q2398176) (← links)
- A non-termination criterion for binary constraint logic programs (Q3621267) (← links)
- Loops under Strategies (Q3636816) (← links)
- Loop Elimination, a Sound Optimisation Technique for PTTP Related Theorem Proving (Q4898739) (← links)
- Guided unfoldings for finding loops in standard term rewriting (Q6085974) (← links)
- Non-termination in Term Rewriting and Logic Programming (Q6493567) (← links)