Goal-directed and relative dependency pairs for proving the termination of narrowing
From MaRDI portal
Publication:3558285
DOI10.1007/978-3-642-12592-8_5zbMATH Open1284.68186OpenAlexW1496043728MaRDI QIDQ3558285FDOQ3558285
Authors: Naoki Nishida, Germán Vidal, José Iborra
Publication date: 4 May 2010
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12592-8_5
Recommendations
Cited In (6)
- Termination of Narrowing in Left-Linear Constructor Systems
- Termination of narrowing via termination of rewriting
- Reducing relative termination to dependency pair problems
- Relative termination via dependency pairs
- Termination of Narrowing Using Dependency Pairs
- Narrowing-based simulation of term rewriting systems with extra variables and its termination proof
Uses Software
This page was built for publication: Goal-directed and relative dependency pairs for proving the termination of narrowing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558285)