How to prove equivalence of term rewriting systems without induction
From MaRDI portal
Publication:1183582
zbMath0746.68049MaRDI QIDQ1183582
Publication date: 28 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
A proof method for local sufficient completeness of term rewriting systems ⋮ Confluence of terminating membership conditional TRS ⋮ Completion after Program Inversion of Injective Functions ⋮ Confluence and commutation for nominal rewriting systems with atom-variables
This page was built for publication: How to prove equivalence of term rewriting systems without induction
