Fast Knuth-Bendix completion with a term rewriting system compiler

DOI10.1016/0020-0190(89)90026-4zbMath0677.68021OpenAlexW2030670114WikidataQ122480309 ScholiaQ122480309MaRDI QIDQ1123602

Yoshihito Toyama

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90026-4

zbMATH Keywords

compilercompletion algorithmterm rewriting system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Artificial intelligence (68T99) Theory of software (68N99)

Related Items (1)

Left-to-right tree pattern matching

Cites Work

• Compiling and optimizing methods for the functional language ASL/F
• Computing with rewrite systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast Knuth-Bendix completion with a term rewriting system compiler