Geodesic
An algorithm for finding a minimal recursive path ordering
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) no. 4, pp. 359-382 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

@article{ITA_1985__19_4_359_0,
     author = {A{\"\i}t-Kaci, Hassan},
     title = {An algorithm for finding a minimal recursive path ordering},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {359--382},
     year = {1985},
     publisher = {EDP-Sciences},
     volume = {19},
     number = {4},
     mrnumber = {827483},
     zbl = {0578.68029},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1985__19_4_359_0/}
}
TY  - JOUR
AU  - Aït-Kaci, Hassan
TI  - An algorithm for finding a minimal recursive path ordering
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1985
SP  - 359
EP  - 382
VL  - 19
IS  - 4
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1985__19_4_359_0/
LA  - en
ID  - ITA_1985__19_4_359_0
ER  - 
%0 Journal Article
%A Aït-Kaci, Hassan
%T An algorithm for finding a minimal recursive path ordering
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1985
%P 359-382
%V 19
%N 4
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1985__19_4_359_0/
%G en
%F ITA_1985__19_4_359_0
Aït-Kaci, Hassan. An algorithm for finding a minimal recursive path ordering. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) no. 4, pp. 359-382. http://geodesic.mathdoc.fr/item/ITA_1985__19_4_359_0/