Skip to content
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

replace fsdist_convA by its generic version convA0 #122

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions fail_lib.v
Original file line number Diff line number Diff line change
Expand Up @@ -1010,6 +1010,9 @@
Section qperm.
Variables (M : altMonad) (A : UU0) (d : unit) (T : orderType d).

Set Printing All.
Set Printing Universes.

Equations? qperm (s : seq A) : M (seq A) by wf (size s) lt :=
| [::] => Ret [::]
| x :: xs =>
Expand All @@ -1020,7 +1023,7 @@
exact: (leq_ltn_trans (size_bseq ys)).
apply /ltP.
exact: (leq_ltn_trans (size_bseq zs)).
Defined.

Check failure on line 1026 in fail_lib.v

View workflow job for this annotation

GitHub Actions / build (mathcomp/mathcomp:1.16.0-coq-8.16)

Missing universe constraint declared for inductive type:

Check failure on line 1026 in fail_lib.v

View workflow job for this annotation

GitHub Actions / build (mathcomp/mathcomp:1.16.0-coq-8.17)

Missing universe constraint declared for inductive type:

Check failure on line 1026 in fail_lib.v

View workflow job for this annotation

GitHub Actions / build (mathcomp/mathcomp:1.17.0-coq-8.16)

Missing universe constraint declared for inductive type:

Check failure on line 1026 in fail_lib.v

View workflow job for this annotation

GitHub Actions / build (mathcomp/mathcomp:1.17.0-coq-8.17)

Missing universe constraint declared for inductive type:

Lemma qperm_nil : qperm [::] = Ret [::].
Proof. by []. Qed.
Expand Down
6 changes: 5 additions & 1 deletion proba_monad_model.v
Original file line number Diff line number Diff line change
Expand Up @@ -88,7 +88,11 @@ Let choiceA : forall (T : Type) (p q r s : prob) (a b c : acto T),
let bc := (choice q _ b c) in
let ab := (choice r _ a b) in
choice p _ a bc = choice s _ ab c.
Proof. by move=> ? ? ? ? ? ? ? ? ? /=; exact: fsdist_convA. Qed.
Proof.
move=> ? p q r s a b c [] ? ? /=.
rewrite /choice -/(conv p a (conv q b c)) -/(conv s (conv r a b) c).
exact: convA0.
Qed.
Let prob_bindDl p :
BindLaws.left_distributive (@hierarchy.bind [the monad of acto]) (choice p).
Proof.
Expand Down
Loading