1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
(* Ancien bug signale par Laurent Thery sur la condition de garde *)
Require Import Bool.
Require Import ZArith.
Definition rNat := positive.
Inductive rBoolOp : Set :=
| rAnd : rBoolOp
| rEq : rBoolOp.
Definition rlt (a b : rNat) : Prop := Pos.compare_cont Eq a b = Lt.
Definition rltDec : forall m n : rNat, {rlt m n} + {rlt n m \/ m = n}.
Proof.
intros n m; generalize (nat_of_P_lt_Lt_compare_morphism n m);
generalize (nat_of_P_gt_Gt_compare_morphism n m);
generalize (Pcompare_Eq_eq n m); case (Pos.compare_cont Eq n m).
intros H' H'0 H'1; right; right; auto.
intros H' H'0 H'1; left; unfold rlt.
apply nat_of_P_lt_Lt_compare_complement_morphism; auto.
intros H' H'0 H'1; right; left; unfold rlt.
apply nat_of_P_lt_Lt_compare_complement_morphism; auto.
apply H'0; auto.
Defined.
Definition rmax : rNat -> rNat -> rNat.
Proof.
intros n m; case (rltDec n m); intros Rlt0.
exact m.
exact n.
Defined.
Inductive rExpr : Set :=
| rV : rNat -> rExpr
| rN : rExpr -> rExpr
| rNode : rBoolOp -> rExpr -> rExpr -> rExpr.
Fixpoint maxVar (e : rExpr) : rNat :=
match e with
| rV n => n
| rN p => maxVar p
| rNode n p q => rmax (maxVar p) (maxVar q)
end.
(* Check bug #1491 *)
Require Import Streams.
Definition decomp (s:Stream nat) : Stream nat :=
match s with Cons _ s => s end.
CoFixpoint bx0 : Stream nat := Cons 0 bx1
with bx1 : Stream nat := Cons 1 bx0.
Lemma bx0bx : decomp bx0 = bx1.
simpl. (* used to return bx0 in V8.1 and before instead of bx1 *)
reflexivity.
Qed.
(* Check mutually inductive statements *)
Require Import ZArith_base Lia.
Open Scope Z_scope.
Inductive even: Z -> Prop :=
| even_base: even 0
| even_succ: forall n, odd (n - 1) -> even n
with odd: Z -> Prop :=
| odd_succ: forall n, even (n - 1) -> odd n.
Lemma even_pos_odd_pos: forall n, even n -> n >= 0
with odd_pos_even_pos : forall n, odd n -> n >= 1.
Proof.
intros.
destruct H.
lia.
apply odd_pos_even_pos in H.
lia.
intros.
destruct H.
apply even_pos_odd_pos in H.
lia.
Qed.
CoInductive a : Prop := acons : b -> a
with b : Prop := bcons : a -> b.
Lemma a1 : a
with b1 : b.
Proof.
apply acons.
assumption.
apply bcons.
assumption.
Qed.
Require Import List.
(** Extracted from coq_performance_tests *)
Module InnerMatch.
Fixpoint take_uniform_n' {T} (ls : list T) (len : nat) (n : nat) : list T
:= match n, ls, List.rev ls with
| 0%nat, _, _ => nil
| _, nil, _ => nil
| _, _, nil => nil
| 1%nat, cons x _, _ => cons x nil
| 2%nat, cons x nil, _ => cons x nil
| 2%nat, cons x _, cons y _ => cons x (cons y nil)
| S n', cons x xs, _
=> let skip := (Nat.div len n + 1)%nat in
cons x (take_uniform_n' (skipn skip xs) (len - 1 - skip) n')
end.
End InnerMatch.
|
