Detecting looping simplifications
Open Access
- 1 January 1987
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- About the Paterson-Wegman linear unification algorithmJournal of Computer and System Sciences, 1986
- On nontermination of Knuth-Bendix algorithmPublished by Springer Nature ,1986
- A simple non-termination test for the Knuth-Bendix methodPublished by Springer Nature ,1986
- Computing with rewrite systemsInformation and Control, 1985
- TerminationPublished by Springer Nature ,1985
- About the rewriting systems produced by the Knuth-Bendix completion algorithmInformation Processing Letters, 1983
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- Linear unificationJournal of Computer and System Sciences, 1978