pl/frap
1
0
Fork 0
mirror of https://github.com/achlipala/frap.git synced 2024-12-01 00:26:18 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Proofreading FirstClassFunctions

Browse source
This commit is contained in:
Adam Chlipala 2020-02-09 13:17:48 -05:00
parent a0993b537d
commit c050ec21ae
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
FirstClassFunctions.v
View file

@ -164,7 +164,7 @@ Fixpoint sorted {A} (le : A -> A -> bool) (ls : list A) : bool :=
end end
end. end.
(* [insert] preserves sortedness. Note the crucial hypothesis that comaprator (* [insert] preserves sortedness. Note the crucial hypothesis that comparator
* [le] is *total*: any two elements are related by it, in one order or the * [le] is *total*: any two elements are related by it, in one order or the
* other. *) * other. *)
Lemma insert_sorted : forall {A} (le : A -> A -> bool) a, Lemma insert_sorted : forall {A} (le : A -> A -> bool) a,
@ -189,7 +189,7 @@ Proof.
rewrite H3, H4; trivial. rewrite H3, H4; trivial.
rewrite H1; simplify. rewrite H1; simplify.
trivial. trivial.
Qed. Qed.
(* Main theorem: [insertion_sort] produces only sorted lists. *) (* Main theorem: [insertion_sort] produces only sorted lists. *)
Theorem insertion_sort_sorted : forall {A} (le : A -> A -> bool), Theorem insertion_sort_sorted : forall {A} (le : A -> A -> bool),