Work

The Size-Change Termination Principle for Constructor Based Languages

Year: 2014

Type: article

Abstract: 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: Logical Methods in Computer Science

DOI: 10.2168/lmcs-10(1:11)2014

Author: Hyvernat Pierre

Institutions: Centre National de la Recherche Scientifique, Université Savoie Mont Blanc

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Agence Nationale de la Recherche

Award: Realizability for classical logic, concurrency, references and rewriting