Structural vs. Cyclic Induction - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Structural vs. Cyclic Induction

Abstract

Structural and (Noetherian) cyclic induction are two instances of the Noetherian induction principle adapted to reason on first-order logic. From a theoretical point of view, every structural proof can be converted to a cyclic proof but the other way is only conjectured. From a practical point of view, i) structural induction principles are built-in or automatically issued from the analysis of recursive data structures by many theorem provers, and ii) the implementation of cyclic induction reasoning may require additional resources such as functional schemas, libraries and human interaction. In this paper, we firstly define a set of conjectures that can be proved by using cyclic induction and following a similar scenario. Next, we implement the cyclic induction reasoning in the Coq proof assistant. Finally, we show that the scenarios for proving these conjectures with structural induction differ in terms of the number of induction steps and lemmas, as well as proof scenario. We identified three conjectures from this set that are hard or impossible to be proved by structural induction.
Fichier principal
Vignette du fichier
Str__2016b.pdf (256.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01590647 , version 1 (19-09-2017)

Identifiers

Cite

Sorin Stratulat. Structural vs. Cyclic Induction: A Report on Some Experiments with Coq. SYNASC'2016 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2016, Timisoara, Romania. pp.29 - 36, ⟨10.1109/SYNASC.2016.018⟩. ⟨hal-01590647⟩

Collections

UNIV-LORRAINE
62 View
310 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More