Construction d'un plus petit ordre de simplification

J. P. Jouannaud; H. Kirchner

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1984)

  • Volume: 18, Issue: 3, page 191-208
  • ISSN: 0988-3754

How to cite

top

Jouannaud, J. P., and Kirchner, H.. "Construction d'un plus petit ordre de simplification." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 18.3 (1984): 191-208. <http://eudml.org/doc/92207>.

@article{Jouannaud1984,
author = {Jouannaud, J. P., Kirchner, H.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {term rewriting systems; simplification ordering; termination of a rewrite rule},
language = {fre},
number = {3},
pages = {191-208},
publisher = {EDP-Sciences},
title = {Construction d'un plus petit ordre de simplification},
url = {http://eudml.org/doc/92207},
volume = {18},
year = {1984},
}

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
PB - EDP-Sciences
VL - 18
IS - 3
SP - 191
EP - 208
LA - fre
KW - term rewriting systems; simplification ordering; termination of a rewrite rule
UR - http://eudml.org/doc/92207
ER -

References

top
  1. 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 Zbl0525.68054MR648438
  2. 2. DONER, Trees Acceptors and Some of Their Applications, J. Computer System Science, vol. 4, 1970, p. 406-451. Zbl0212.02901MR287977
  3. 3. J. V. GUTTAG, The Specification and Application to Programming of Abstract Data Types, Ph. D. Thesis, University of Toronto, 1975. 
  4. 4. G. HUET et J. M. HULLOT, Proofs by Induction in Equational Theories with Constructors, Proc. 21th Symposium on Foundation of Computer Science, 1980. Zbl0532.68041
  5. 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. 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. 7. J. HSIANG et N. DERSHOWITZ, Rewrite Methods for Clausal and non Clausal Theorem Proving, Proc. l0th I.C.A.L.P., 1983. Zbl0523.68080
  8. 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. Zbl0516.68067MR727669
  9. 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. Zbl0513.68026
  10. 10. D. KNUTH et P. BENDIX, Simple word Problems in Universal Algebras, in Computational Problems in Abstract Algebra, J. LEECH, éd., Pergamon Press, 1970. Zbl0188.04902MR255472
  11. 11. KAMIN et J. J. LEVY, Attempts for Generalizing the Recursive Path Ordering, to be published. 
  12. 12. J. B. KRUSKAL, Well Quasi Ordering, the Tree Theorem and Vazsonyi's conjecture, Trans. Amer. Math. Soc., vol. 95, 1960, p. 210-225. Zbl0158.27002MR111704
  13. 13. D. PLAISTED, A Recursively Defined Ordering for Proving Terminaison of Term Rewriting Systems, Report 78-943, University of Illinois, 1978. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.