Automated proofs of unique normal forms w.r.t. conversion for term rewriting systems

DOI10.1007/978-3-030-29007-8_19zbMath1435.68361arXiv1807.00940OpenAlexW2970469945MaRDI QIDQ2180238

Takahito Aoto, Yoshihito Toyama

Publication date: 13 May 2020

Full work available at URL: https://arxiv.org/abs/1807.00940

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems

This page was built for publication: Automated proofs of unique normal forms w.r.t. conversion for term rewriting systems