Termination of Rewrite Systems by Elementary Interpretations

Authors:
Pierre Lescanne
Affiliations:
-
Venue:
Proceedings of the Third International Conference on Algebraic and Logic Programming
Year:
1992

Citing 0
Cited 6

From λσ to λν: a journey through calculi of explicit substitutions

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cited References

Computer algebra handbook
Algorithms with polynomial interpretation termination proof

Journal of Functional Programming
Automatic Proofs of Termination With Elementary Interpretations

Electronic Notes in Theoretical Computer Science (ENTCS)
Quasi-interpretations a way to control resources

Theoretical Computer Science
Simplification Orderings: History Of Results

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract