coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: David Monniaux <David.Monniaux AT ens.fr>
- To: coq-club AT pauillac.inria.fr
- Subject: [Coq-Club] induction on arbitrary-arity trees
- Date: Thu, 31 Mar 2005 11:21:30 +0200
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
I have the following definition:
Inductive comp_widening_chain (S : Set) : Set :=
comp_widening_chain_intro : forall x : S,
(forall y : S,
(option (comp_widening_chain S))) -> (comp_widening_chain S).
If I try to do reasonings by induction using the "induction" or "elim" on such a datatype, I don't get an induction hypothesis.
I'm forced to use
refine (fix inductive_predicate (foobar : comp_widening_chain) : ... := _)
But that's clunky, and, I'm afraid, this seems to lead to weird error messages (see other mail).
What is the correct way of doing induction on such things?
Regards,
DM
- [Coq-Club] induction on arbitrary-arity trees, David Monniaux
- Re: [Coq-Club] induction on arbitrary-arity trees, Christine Paulin
- Re: [Coq-Club] induction on arbitrary-arity trees, Hugo Herbelin
Archive powered by MhonArc 2.6.16.