Pierre, Hyvernat - The Size-Change Termination Principle for Constructor Based Languages

lmcs:1003 - Logical Methods in Computer Science, February 13, 2014, Volume 10, Issue 1
The Size-Change Termination Principle for Constructor Based Languages

Authors: Pierre, Hyvernat

This paper describes an automatic termination checker for a generic first-order call-by-value language in ML style. We use the fact that value are built from variants and tuples to keep some information about how arguments of recursive call evolve during evaluation. The result is a criterion for termination extending the size-change termination principle of Lee, Jones and Ben-Amram that can detect size changes inside subvalues of arguments. Moreover the corresponding algorithm is easy to implement, making it a good candidate for experimentation.


Source : oai:arXiv.org:1306.3833
DOI : 10.2168/LMCS-10(1:11)2014
Volume: Volume 10, Issue 1
Published on: February 13, 2014
Submitted on: June 17, 2013
Keywords: Computer Science - Logic in Computer Science,Computer Science - Programming Languages


Share

Consultation statistics

This page has been seen 53 times.
This article's PDF has been downloaded 42 times.