@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. Informatique th\'eorique}, pages = {359--382}, publisher = {EDP-Sciences}, volume = {19}, number = {4}, year = {1985}, mrnumber = {827483}, zbl = {0578.68029}, language = {en}, url = {http://www.numdam.org/item/ITA_1985__19_4_359_0/} }
Aït-Kaci, Hassan. An algorithm for finding a minimal recursive path ordering. RAIRO. Informatique théorique, Tome 19 (1985) no. 4, pp. 359-382. http://www.numdam.org/item/ITA_1985__19_4_359_0/
[ADJ78] An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types, Current Trends in Programming Methodology, in R. T. YEH Ed., V. 4, Prentice Hall, 1978.
, and ,[DER 82] (a) Orderings for Term-Rewriting Systems, Theor. Comp. Sc., Vol. 17, (3), pp. 279-301; | MR | Zbl
,(b) Computing with Rewrite Systems, Technical Paper Draft, Bar-Ilan University, August 1982.
,[DRM79] Proving Termination with Multiset Ordering, Communications of the A.C.M., Vol. 22, (8), 1979, pp. 465-476. | MR | Zbl
and ,[GOT79] An Introduction to OBJ: a Language for Writing and Testing Formal Algebraic Program Specifications, Proceedings of the I.E.E.E. Conference on Specifications of Reliable Software, Cambridge, MA, 1979, pp. 170-189.
and ,[GOR65] Explicit Definitions and linguistic Dominoes, in Systems and Computer Science, J. HART, S. TAKASU Eds., University of Toronto Press, 1965. | MR
,[HOD82] Programming with Equations, A.C.M. Transactions on Programming Languages and Systems, Vol. 4, (1), 1982, pp. 83-112. | Zbl
and ,[HOP80] Equations and Rewrite Rules, in Formal Language Theory, Perspective and Open Problems, R. BOOK Ed., Academic Press, 1980, pp. 349-393.
and ,[HUE81] A Complete Proof of Correctness of the Knuth-Bendix Algorithm, J.C.S.S., Vol. 23,(1), 1981, pp. 11-21. | MR | Zbl
,[JLR83] Recursive Decomposition Ordering, in I.F.I.P. Working Conference on Formal Description of Programming Concepts II, D. BJORNER Ed., North-Holland, 1983. | MR | Zbl
, and ,[JOL82] On Multiset Ordering, Inf. Proc. Lett., Vol. 15, (2), 1982. | MR | Zbl
and ,[LES82] Some Properties of Decomposition Path Ordering, a Simplification Ordering to Prove Termination of Rewriting Systems, R.A.I.R.O., Informatique Theorique, Vol. 16, 1982, pp. 331-347. | Numdam | MR | Zbl
,[LES83] (a) How to Prove Termination? An Approach to the Implementation of a New Recursive Decomposition Ordering, Technical Report, Centre de Recherche en Informatique de Nancy, Nancy, France, July 1983;
,(b) Computer Experiments with the REVE Rewriting System Generator, in Proceedings of the 10th POPL Symposium, 1983.
,[KNB70] Simple Word Problems in Universal Algebra, in Computational Problems in Abstract Algebra, J. LEECH Ed., Pergamon Press, 1970, pp. 263-297. | MR | Zbl
and ,[MUS79] Abstract Data Types Specification in the AFFIRM System, Proceedings of the I.E.E.E. Conference on Specifications of Reliable Software, Cambridge, Ma., 1979, pp. 45-57.
,[ODN78] Computing in Systems Described by Equations, Lecture Notes in Computer Science, Vol. 58, Springer-Verlag, 1978. | MR | Zbl
,[PLT78] A Recursively Defined Ordering for Proving Termination of Term-Rewriting Systems, Report R-78-943, Department of Computer Science, University of Illinois, Urbana, III., 1978.
,[PTS81] Complete Sets of Reductions for some Equational Theories, J.A.C.M., Vol. 28, (2), 1981, pp. 233-264. | MR | Zbl
and ,[ROS73] Tree-Manipulating Systems and Church-Rosser Theorems, J.A.C.M., Vol. 20, (1), 1973, pp. 160-187. | MR | Zbl
,