Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems
Pierre Lescanne (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “An algorithm for finding a minimal recursive path ordering”
Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems
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:
A formalism for treating equivalence of recursive procedures
Alex Pelin (1985)
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:
Logic and functional programming by retractions : operational semantics
M. Bellia (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The theory of invertible algorithms
Gianni Aguzzi (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Implementing term rewriting by jungle evaluation
Berthold Hoffmann, Detlef Plump (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: