Skip to Content.
Sympa Menu

coq-club - [Coq-Club] How to talk about a restricted set of an inductive?

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

[Coq-Club] How to talk about a restricted set of an inductive?


Chronological Thread 
  • From: Fabien Renaud <Fabien.Renaud AT inria.fr>
  • To: coq-club AT inria.fr
  • Subject: [Coq-Club] How to talk about a restricted set of an inductive?
  • Date: Thu, 3 Oct 2013 12:01:44 +0200

Hello,

The subject of my question is not very clear but my problem yes:

For the illustration, suppose I have this (weird) inductive:

Inductive NList_ {A : Type} : nat -> list A -> Type :=
| Base l: NList_ 0 l
| Cons n l a: NList_ n l -> NList_ (S n) (a::l).

Now I want to start building NList_ such that the first argument is always the length of the list:

Definition NList {A : Type} (l : list A) := NList_ (length l) l.


Is there a way to state properties about NList_ created by NList like
forall l n, NList_ n l -> length l = n?

Thanks,
Fabien




Archive powered by MHonArc 2.6.18.

Top of Page