Construction d'un plus petit ordre de simplification
Open Access
- 1 January 1984
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 18 (3) , 191-208
- https://doi.org/10.1051/ita/1984180301911
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsKeywords
This publication has 6 references indexed in Scilit:
- Incremental construction of unification algorithms in equational theoriesPublished by Springer Nature ,2006
- Proofs by induction in equational theories with constructorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- Orderings for term-rewriting systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's ConjectureTransactions of the American Mathematical Society, 1960