Construction d'un plus petit ordre de simplification
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984) no. 3, pp. 191-208.
@article{ITA_1984__18_3_191_0,
     author = {Jouannaud, J. P. and Kirchner, H.},
     title = {Construction d'un plus petit ordre de simplification},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {191--208},
     publisher = {EDP-Sciences},
     volume = {18},
     number = {3},
     year = {1984},
     zbl = {0541.68013},
     mrnumber = {763666},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1984__18_3_191_0/}
}
TY  - JOUR
AU  - Jouannaud, J. P.
AU  - Kirchner, H.
TI  - Construction d'un plus petit ordre de simplification
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1984
DA  - 1984///
SP  - 191
EP  - 208
VL  - 18
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1984__18_3_191_0/
UR  - https://zbmath.org/?q=an%3A0541.68013
UR  - https://www.ams.org/mathscinet-getitem?mr=763666
LA  - fr
ID  - ITA_1984__18_3_191_0
ER  - 
Jouannaud, J. P.; Kirchner, H. Construction d'un plus petit ordre de simplification. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984) no. 3, pp. 191-208. http://www.numdam.org/item/ITA_1984__18_3_191_0/

1.N. Dershowitz, Orderings for Term Rewriting Systems, Proc. 20th Symposium on Foundations of Computer Science, 1979, p. 123-131, also in TCS 17-3, 1982 | MR 648438 | Zbl 0525.68054

2.Doner, Trees Acceptors and Some of Their Applications, J. Computer System Science, vol. 4, 1970, p. 406-451. | MR 287977 | Zbl 0212.02901

3.J. V. Guttag, The Specification and Application to Programming of Abstract Data Types, Ph. D. Thesis, University of Toronto, 1975.

4.G. Huet et J. M. Hullot, Proofs by Induction in Equational Theories with Constructors, Proc. 21th Symposium on Foundation of Computer Science, 1980.

5.G. Huet et D. S. Lankford , On the Uniform Halting Problem for Term Rewriting Systems, Rapport Laboria, n° 283, I.N.R.I.A., 1978.

6.G. Huet, D. C. Oppen, Equations and Rewrite Rules: a Survey, in Formal Languages: Perspectives and Open Problems, R. BOOK, éd., Academic Press, 1980.

7.J. Hsiang et N. Dershowitz, Rewrite Methods for Clausal and non Clausal Theorem Proving, Proc. l0th I.C.A.L.P., 1983. | Zbl 0523.68080

8. J. P. Jouannaud, C. Kirchner et H. Kirchner, Incremental Construction of Unification Algorithms in Equational Theories, Proc. 10th I.C.A.L.P., 1983. | MR 727669 | Zbl 0516.68067

9. J. P. Jouannaud, P. Lescanne et F. Reing, Recursive Decomposition Ordering, in Formal Description of Programming Concepts 2, D. BJORNER, éd., North Holland, 1982. | Zbl 0513.68026

10. D. Knuth et P. Bendix, Simple word Problems in Universal Algebras, in Computational Problems in Abstract Algebra, J. LEECH, éd., Pergamon Press, 1970. | MR 255472 | Zbl 0188.04902

11. Kamin et J. J. Levy, Attempts for Generalizing the Recursive Path Ordering, to be published.

12. J. B. Kruskal, Well Quasi Ordering, the Tree Theorem and Vazsonyi's conjecture, Trans. Amer. Math. Soc., vol. 95, 1960, p. 210-225. | MR 111704 | Zbl 0158.27002

13. D. Plaisted, A Recursively Defined Ordering for Proving Terminaison of Term Rewriting Systems, Report 78-943, University of Illinois, 1978.