diff options
| author | Pierre Courtieu | 2020-05-14 14:46:56 +0200 |
|---|---|---|
| committer | Théo Zimmermann | 2020-05-16 15:43:14 +0200 |
| commit | 888aaeb0a948352cf56f1f6d8023a051e90583a0 (patch) | |
| tree | 6a74e6caefdcb4545d0d978454c7b1d635215bd9 /test-suite | |
| parent | ebaaa7371c3a3548ccec1836621726f6d829858a (diff) | |
Fix #11761: Functional Induction throws unrecoverable error.
Error happened only when writing:
functional induction f x y z.
instead of
functional induction (f x y z).
Now the former is equivalent to the former: implicits must be omitted.
Hence small source of incompatibility, but a more homogeneous
behaviour.
Diffstat (limited to 'test-suite')
| -rw-r--r-- | test-suite/success/Funind.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/test-suite/success/Funind.v b/test-suite/success/Funind.v index f87f2e2a9d..e371cf251f 100644 --- a/test-suite/success/Funind.v +++ b/test-suite/success/Funind.v @@ -77,7 +77,7 @@ Functional Scheme app_ind := Induction for app Sort Prop. Lemma appnil : forall (A : Set) (l l' : list A), l' = nil -> l = l ++ l'. intros A l l'. - functional induction app A l l'; intuition. + functional induction app l l'; intuition. rewrite <- H0; trivial. Qed. |