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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Bottom-up computation of recursive programs”
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:
Data types as algorithms
M. A. Nait Abdallah (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Proposal for a natural formalization of functional programming concepts
Patrick Bellot, Djamil Sarni (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Toward a semantics for the QUEST language
Fabio Alessi, Franco Barbanera (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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:
On the complexity of computable real sequences
Jacobo Torán (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: