An algorithm for finding a minimal recursive path ordering
Hassan Aït-Kaci (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems”
An algorithm for finding a minimal recursive path ordering
Complexity of theorem-proving procedures : some general properties
G. Longo, M. Venturini Zilli (1974)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the complexity of computable real sequences
Jacobo Torán (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Data types as algorithms
M. A. Nait Abdallah (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On effective speed-up and long proofs of trivial theorems in formal theories
J. Hartmanis (1976)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Limiting recursion and the arithmetic hierarchy
G. Criscuolo, E. Minicozzi, G. Trautteur (1975)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A hierarchy of primitive recursive sequence functions
E. Fachini, A. Maggiolo-Schettini (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: