A proof method for local sufficient completeness of term rewriting systems
From MaRDI portal
Publication:2119990
DOI10.1007/978-3-030-85315-0_22OpenAlexW3195150266MaRDI QIDQ2119990
Tomoki Shiraishi, Kentaro Kikuchi, Takahito Aoto
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85315-0_22
Cites Work
- Unnamed Item
- Unnamed Item
- Decreasing diagrams and relative termination
- Proving weak properties of rewriting
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
- On sufficient-completeness and related properties of term rewriting systems
- How to prove equivalence of term rewriting systems without induction
- The algebraic specification of abstract data types
- Ground reducibility is EXPTIME-complete
- Term Rewriting and All That
This page was built for publication: A proof method for local sufficient completeness of term rewriting systems
