diff options
| author | Xavier Leroy <xavier.leroy@college-de-france.fr> | 2021-04-19 19:08:08 +0200 |
|---|---|---|
| committer | Xavier Leroy <xavier.leroy@college-de-france.fr> | 2021-04-19 19:08:08 +0200 |
| commit | e4542668e6d348e0300e76bb77105af24aff4233 (patch) | |
| tree | 6d10b4d627dcb40512d3ddb94a04d9ebeaf4a64a /lib | |
| parent | 7563a5df926a4c6fb1489a7a4c847641c8a35095 (diff) | |
| download | compcert-kvx-e4542668e6d348e0300e76bb77105af24aff4233.tar.gz compcert-kvx-e4542668e6d348e0300e76bb77105af24aff4233.zip | |
Use List.repeat from Coq's standard library instead of list_repeat
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/Coqlib.v | 20 |
1 files changed, 0 insertions, 20 deletions
diff --git a/lib/Coqlib.v b/lib/Coqlib.v index bd52d20a..e0789078 100644 --- a/lib/Coqlib.v +++ b/lib/Coqlib.v @@ -1153,26 +1153,6 @@ Proof. destruct l; simpl; auto. Qed. -(** A list of [n] elements, all equal to [x]. *) - -Fixpoint list_repeat {A: Type} (n: nat) (x: A) {struct n} := - match n with - | O => nil - | S m => x :: list_repeat m x - end. - -Lemma length_list_repeat: - forall (A: Type) n (x: A), length (list_repeat n x) = n. -Proof. - induction n; simpl; intros. auto. decEq; auto. -Qed. - -Lemma in_list_repeat: - forall (A: Type) n (x: A) y, In y (list_repeat n x) -> y = x. -Proof. - induction n; simpl; intros. elim H. destruct H; auto. -Qed. - (** * Definitions and theorems over boolean types *) Definition proj_sumbool {P Q: Prop} (a: {P} + {Q}) : bool := |