scientific article

zbMath0667.68042MaRDI QIDQ3819992

Jonathan Stillman, Deepak Kapur, Paliath Narendran, David R. Musser

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matchingdecision procedureKnuth-Bendix completionterm-rewriting systemnon-terminationsemi-unification algorithm

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items

Fast algorithms for uniform semi-unification ⋮ It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair ⋮ Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) ⋮ Extending the type checker of Standard ML by polymorphic recursion