General size-change termination and lexicographic descent

Authors:
Amir M. Ben-Amram
Affiliations:
The Academic College of Tel-Aviv Yaffo, Tel-Aviv, Israel
Venue:
The essence of computation
Year:
2002

Citing 1
Cited 4

The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Termination analysis and specialization-point insertion in offline partial evaluation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Program termination analysis in polynomial time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Ranking functions for size-change termination

ACM Transactions on Programming Languages and Systems (TOPLAS)
Primitive rewriting

Processes, Terms and Cycles

Quantified Score

Hi-index	0.00

Visualization

Abstract

Size-change termination (SCT) is a general criterion to identify recursive function definitions that are guaranteed to terminate. It extends and subsumes the simpler criterion of lexicographic descent in function calls, which in classical recursion theory is known as multiple recursion . Neil Jones has conjectured that the class of functions computable by size-change terminating programs coincides with the multiply-recursive functions. This paper proves so.