International audienceProofs by induction on some inductively defined structure, e. g., finitely-branching trees, may appeal to the induction hypothesis at any point in the proof, provided the induction hypothesis is only used for immediate substructures, e. g., the subtrees of the node we are currently considering in the proof. The basic principle of structural induction can be relaxed to course-of-value induction, which allows application of the induction hypothesis also to non-immediate substructures, like any proper subtree of the current tree. If course-of-value induction is not sufficient yet, we can resort to define a well-founded relation on the considered structure and use the induction hypothesis for any substructure which is stri...
Mathematical induction can be informally illustrated by reference to the sequential effect of fall...
Coinductive data types are used in functional programming to represent infinite data struc-tures. Ex...
Colloque avec actes et comité de lecture. internationale.International audienceProofs techniques can...
. We present a categorical logic formulation of induction and coinduction principles for reasoning a...
AbstractWe present a categorical logic formulation of induction and coinduction principles for reaso...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
Induction is the process by which we obtain predictive laws or theories or models of the world. We c...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
In this paper, we develop a new approach for mechanizing induction on complex data structures (like ...
International audienceStructural and (Noetherian) cyclic induction are two instances of the Noetheri...
International audienceSuperposition-based provers have been successfully used to discharge proof obl...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
A theorem proving system has been programmed for automating mildly complex proofs by structural indu...
This thesis studies induction and coinduction schemes from the point of view of category theory. We...
The paper illustrates the use of mathematical induction to extend results which are true for a line ...
Mathematical induction can be informally illustrated by reference to the sequential effect of fall...
Coinductive data types are used in functional programming to represent infinite data struc-tures. Ex...
Colloque avec actes et comité de lecture. internationale.International audienceProofs techniques can...
. We present a categorical logic formulation of induction and coinduction principles for reasoning a...
AbstractWe present a categorical logic formulation of induction and coinduction principles for reaso...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
Induction is the process by which we obtain predictive laws or theories or models of the world. We c...
Induction is a well-established proof principle that is taught in most undergraduate programs in mat...
In this paper, we develop a new approach for mechanizing induction on complex data structures (like ...
International audienceStructural and (Noetherian) cyclic induction are two instances of the Noetheri...
International audienceSuperposition-based provers have been successfully used to discharge proof obl...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
A theorem proving system has been programmed for automating mildly complex proofs by structural indu...
This thesis studies induction and coinduction schemes from the point of view of category theory. We...
The paper illustrates the use of mathematical induction to extend results which are true for a line ...
Mathematical induction can be informally illustrated by reference to the sequential effect of fall...
Coinductive data types are used in functional programming to represent infinite data struc-tures. Ex...
Colloque avec actes et comité de lecture. internationale.International audienceProofs techniques can...