aboutsummaryrefslogtreecommitdiff
path: root/test-suite/success
diff options
context:
space:
mode:
Diffstat (limited to 'test-suite/success')
-rw-r--r--test-suite/success/AdvancedTypeClasses.v2
-rw-r--r--test-suite/success/Generalization.v1
-rw-r--r--test-suite/success/ProgramWf.v5
-rw-r--r--test-suite/success/dependentind.v4
4 files changed, 10 insertions, 2 deletions
diff --git a/test-suite/success/AdvancedTypeClasses.v b/test-suite/success/AdvancedTypeClasses.v
index 219a8a7551..a6f1e299b1 100644
--- a/test-suite/success/AdvancedTypeClasses.v
+++ b/test-suite/success/AdvancedTypeClasses.v
@@ -1,3 +1,5 @@
+Generalizable Variables all.
+
Open Scope type_scope.
Section type_reification.
diff --git a/test-suite/success/Generalization.v b/test-suite/success/Generalization.v
index 6b503e95ae..4ec0a79ba1 100644
--- a/test-suite/success/Generalization.v
+++ b/test-suite/success/Generalization.v
@@ -1,3 +1,4 @@
+Generalizable Variables all.
Check `(a = 0).
Check `(a = 0)%type.
diff --git a/test-suite/success/ProgramWf.v b/test-suite/success/ProgramWf.v
index 18111f07c5..81bdbc29f0 100644
--- a/test-suite/success/ProgramWf.v
+++ b/test-suite/success/ProgramWf.v
@@ -56,7 +56,10 @@ Lemma merge_unfold n m : merge n m =
| 0 => 0
| S n' => merge n' m
end.
-Proof. intros. unfold_sub merge (merge n m). simpl. destruct n ; reflexivity. Qed.
+Proof. intros. unfold merge at 1. unfold merge_func.
+ unfold_sub merge (merge n m).
+ simpl. destruct n ; reflexivity.
+Qed.
Print merge.
diff --git a/test-suite/success/dependentind.v b/test-suite/success/dependentind.v
index f308bdfd9b..a19515d06c 100644
--- a/test-suite/success/dependentind.v
+++ b/test-suite/success/dependentind.v
@@ -1,4 +1,4 @@
-Require Import Coq.Program.Program Coq.Program.Equations.
+Require Import Coq.Program.Program Coq.Program.Equality.
Variable A : Set.
@@ -50,6 +50,8 @@ Notation " Γ ; Δ " := (conc Δ Γ) (at level 25, left associativity) : contex
Reserved Notation " Γ ⊢ τ " (at level 30, no associativity).
+Generalizable Variables all.
+
Inductive term : ctx -> type -> Type :=
| ax : `(Γ, τ ⊢ τ)
| weak : `{Γ ⊢ τ -> Γ, τ' ⊢ τ}