-
Notifications
You must be signed in to change notification settings - Fork 5
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
V2.0 #25
V2.0 #25
Conversation
going on with graph.v
dangling target node or not. i think not.
removed the corresponding comment, and repositioned the lemmas.
given as an equation, but as implication into False.
examples/quicksort.v
Outdated
(* Brief mathematics of quickorting *) | ||
(* There is some overlap with mathematics developed for bubblesort *) | ||
(* but the development is repeated here to make the files *) | ||
(* self-contained *) | ||
|
||
Lemma perm_onC {T : finType} (S1 S2 : {set T}) (u1 u2 : {perm T}) : |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This one can also be deleted, it was merged: https://github.com/math-comp/math-comp/blob/master/mathcomp/fingroup/perm.v#L198
examples/quicksort.v
Outdated
by rewrite !(out_perm pS1) //; apply: S12; rewrite // perm_closed. | ||
by rewrite (out_perm pS1) // (out_perm pS2) // (out_perm pS1). | ||
Qed. | ||
|
||
Lemma tperm_on {T : finType} (x y : T) : perm_on [set x; y] (tperm x y). | ||
Lemma tperm_on {T : finType} (x y : T) : |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
ok, i'll submit new pull request. let me close this one first. |
Upgrading to mathcomp2