pl/frap
1
0
Fork 0
mirror of https://github.com/achlipala/frap.git synced 2024-11-27 23:06:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Polymorphism: add a comment about the infamous quantifier-ordering issue with induction

Browse source
This commit is contained in:
Adam Chlipala 2017-02-15 10:01:49 -05:00
parent cf4d06c222
commit 643d44e524
1 changed files with 7 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
Polymorphism.v
View file

@ -189,6 +189,13 @@ Proof.
equality.
Qed.
(* IMPORTANT NOTE: the proof above would *not* have worked with the orders of
* variables [ls] and [acc] swapped in the lemma statement! Try the proof that
* way to see what goes wrong. The problem is that the induction hypothesis
* would be too weak. A single [acc] value would be fixed for the whole proof,
* while we need [acc] to *vary* throughout the induction, by retaining a
* universal quantifier for it in the IH. *)
(* Concatenating the empty list has no effect. *)
Lemma app_nil : forall A (ls : list A),
ls ++ [] = ls.