On Formalised Proofs of Termination of Recursive Functions

In proof checkers and theorem provers (e.g. Coq [4] and ProPre [13]) recursive definitions of functions are shown to terminate automatically. In standard non-formalised termination proofs of recursive functions, a decreasing measure is sometimes used. Such a decreasing measure is usually difficult to find.

[1]  Jürgen Giesl,et al.  Termination Analysis for Functional Programs using Term Orderings , 1995, SAS.

[2]  Pierre Lescanne,et al.  Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation , 1987, Sci. Comput. Program..

[3]  Pascal Manoury.  A User's Friendly Syntax to Define Recursive Functions as Typed lambda-Terms , 1994, TYPES.

[4]  Jürgen Giesl.  Automated Termination Proofs with Measure Functions , 1995, KI.

[5]  Frank van Harmelen,et al.  Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs , 1990, CADE.

[6]  Robert S. Boyer,et al.  A computational logic handbook , 1979, Perspectives in computing.

[7]  Claus-Rainer Rollinger,et al.  KI-95: Advances in Artificial Intelligence , 1995, Lecture Notes in Computer Science.

[8]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[9]  Christoph Walther,et al.  Argument-Bounded Algorithms as a Basis for Automated Termination Proofs , 1988, CADE.

[10]  Pascal Manoury,et al.  Des preuves de totalite de fonctions comme synthese de programmes , 1992 .

[11]  Christoph Walther,et al.  On Proving the Termination of Algorithms by Machine , 1994, Artif. Intell..

[12]  Michel Parigot,et al.  Programming with Proofs , 1990, J. Inf. Process. Cybern..

[13]  Flemming Nielson,et al.  Operational Semantics of Termination Types , 1996, Nord. J. Comput..

[14]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[15]  J. Urgen Giesl.  Generating Polynomial Orderings for Termination Proofs ? , 1995 .

[16]  Michel Parigot.  Recursive Programming with Proofs , 1992, Theor. Comput. Sci..

[17]  Jürgen Giesl,et al.  Generating Polynomial Orderings for Termination Proofs , 1995, RTA.

[18]  Marianne Simonot,et al.  Automatizing Termination Proofs of Recursively Defined Functions , 1994, Theor. Comput. Sci..