Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 4, pp. 331-347
Cet article a éte moissonné depuis la source Numdam
@article{ITA_1982__16_4_331_0,
author = {Lescanne, Pierre},
title = {Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {331--347},
year = {1982},
publisher = {EDP-Sciences},
volume = {16},
number = {4},
mrnumber = {707635},
zbl = {0518.68025},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ITA_1982__16_4_331_0/}
}
TY - JOUR AU - Lescanne, Pierre TI - Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1982 SP - 331 EP - 347 VL - 16 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1982__16_4_331_0/ LA - en ID - ITA_1982__16_4_331_0 ER -
%0 Journal Article %A Lescanne, Pierre %T Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1982 %P 331-347 %V 16 %N 4 %I EDP-Sciences %U http://geodesic.mathdoc.fr/item/ITA_1982__16_4_331_0/ %G en %F ITA_1982__16_4_331_0
Lescanne, Pierre. Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 4, pp. 331-347. http://geodesic.mathdoc.fr/item/ITA_1982__16_4_331_0/
