scientific article; zbMATH DE number 7438161
From MaRDI portal
Publication:5013816
zbMath1477.68164arXiv1603.00975MaRDI QIDQ5013816
Publication date: 2 December 2021
Full work available at URL: https://arxiv.org/abs/1603.00975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A formalization of the Knuth-Bendix(-Huet) critical pair theorem
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- On theories with a combinatorial definition of 'equivalence'
- Term Rewriting and All That
- Tree-Manipulating Systems and Church-Rosser Theorems
This page was built for publication: