scientific article

From MaRDI portal

Revision as of 15:26, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3819992

Jump to:navigation, search

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

matching decision procedure Knuth-Bendix completion term-rewriting system non-termination semi-unification algorithm

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (4)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3819992&oldid=17403356"