blob: 1825db1676b6f2ebdb7baf0dee3fe4fc8814eff0 (
plain)
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
|
(* Check that types are not uselessly unfolded *)
(* Check here that P returns something of type "option L" and not
"option (list nat)" *)
Definition L := list nat.
Definition P (e:option L) :=
match e with
| None => None
| Some cl => Some cl
end.
Print P.
(* Check that plus is folded even if reduction is involved *)
Set Refolding Reduction.
Check (fun m n p (H : S m <= (S n) + p) => le_S_n _ _ H).
(* Check that the heuristic to solve constraints is not artificially
dependent on the presence of a let-in, and in particular that the
second [_] below is not inferred to be n, as if obtained by
first-order unification with [T n] of the conclusion [T _] of the
type of the first [_]. *)
(* Note: exact numbers of evars are not important... *)
Inductive T (n:nat) : Type := A : T n.
Check fun n (x:=A n:T n) => _ _ : T n.
Check fun n => _ _ : T n.
|
