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

test for step 0 of CoREACT #357

Draft
wants to merge 10 commits into
base: master
Choose a base branch
from
Draft
Show file tree
Hide file tree
Changes from 8 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
2 changes: 2 additions & 0 deletions _CoqProject.test-suite
Original file line number Diff line number Diff line change
Expand Up @@ -80,6 +80,8 @@ tests/hnf.v
tests/fun_instance.v
tests/issue284.v
tests/issue287.v
tests/monoid_law_structure.v
tests/monoid_law_structure_clone.v

-R tests HB.tests
-R examples HB.examples
Expand Down
55 changes: 55 additions & 0 deletions tests/monoid_enriched_cat.v
Original file line number Diff line number Diff line change
@@ -0,0 +1,55 @@
From HB Require Import structures.
From Coq Require Import ssreflect ssrfun.

HB.mixin Record isQuiver Obj := { hom : Obj -> Obj -> Type }.

HB.structure Definition Quiver := { Obj of isQuiver Obj }.

HB.mixin Record isMon A := {
zero : A;
add : A -> A -> A;
addrA : associative add;
add0r : left_id zero add;
addr0 : right_id zero add;
}.

HB.structure
Definition Monoid := { A of isMon A }.

Fail HB.structure
Definition Monoid_enriched_quiver :=
{ Obj of isQuiver Obj &
(forall A B : Obj, isMon (@hom (Quiver.clone Obj _) A B)) }.


(* Step 0: define a wrapper predicate in coq-elpi *)
CohenCyril marked this conversation as resolved.
Show resolved Hide resolved
(* Step 1: add a wrapper attribute to declare wrappers,
Copy link
Member

@CohenCyril CohenCyril Jun 19, 2023

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Here is the code for attribute declaraion

coq.parse-attributes A [
att "verbose" bool,
att "mathcomp" bool,
att "mathcomp.axiom" string,
att "short.type" string,
att "short.pack" string,
att "infer" attmap,
att "key" string,
att "arg_sort" bool,
att "log" bool,
att "log.raw" bool,
att "compress_coercions" bool,
att "export" bool,
att "skip" string,
att "local" bool,

You can then use the get-option predicate to find the value of an attribute

they should index:
- the wrapped mixin (`isMon`)
- the wrapper mixin (`hom_isMon`)
- the new subject (`hom`)
*)
CohenCyril marked this conversation as resolved.
Show resolved Hide resolved
#[wrapper]
HB.mixin Record hom_isMon T of Quiver T :=
{ private : forall A B, isMon (@hom T A B) }.
CohenCyril marked this conversation as resolved.
Show resolved Hide resolved

(* Step 2: at structure declaration, export the main and only projection
of each declared wrapper as an instance of the wrapped structure on
its subject *)
HB.structure
CohenCyril marked this conversation as resolved.
Show resolved Hide resolved
Definition Monoid_enriched_quiver :=
{ Obj of isQuiver Obj & hom_isMon Obj }.

HB.instance Definition _ (T : Monoid_enriched_quiver.type) (A B : T) : isMon (@hom T A B) :=
@private T A B.

(* each instance of isMon should be tried as an instance of hom_isMon *)

(* Step 3: for each instance of a wrapped mixin on a subject known
to be wrapped, automatically produce an instance of the wrapper mixin too. *)
HB.instance Definition _ := isQuiver.Build Type (fun A B => A -> B).
CohenCyril marked this conversation as resolved.
Show resolved Hide resolved
Fail HB.instance Definition homTypeMon (A B : Quiver.type) := isMon.Build (hom A B) (* ... *).
(* This last command should create a `Monoid_enriched_quiver`, in order to do so it should
automatically instanciate the wrapper `hom_isMon`:
HB.instance Definition _ := hom_isMon.Build Type homTypeMon.
*)
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
*)
*)
(* Step 4: automatically produce the wrapper mixin *)

18 changes: 18 additions & 0 deletions tests/monoid_law_structure.v
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
From HB Require Import structures.

HB.mixin Record isMonLaw T (e : T) (op : T -> T -> T) := {
opmA : forall a b c, op (op a b) c = op a (op b c);
op1m : forall x, op e x = x;
opm1 : forall x, op x e = x;
}.

HB.structure Definition MonLaw T e := { op of isMonLaw T e op }.

HB.mixin Record isPreMonoid T := {
zero : T;
add : T -> T -> T;
}.
HB.structure Definition PreMonoid := { T of isPreMonoid T }.

HB.structure Definition Monoid :=
{ T of isPreMonoid T & isMonLaw T zero add }.
19 changes: 19 additions & 0 deletions tests/monoid_law_structure_clone.v
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
From HB Require Import structures.

HB.mixin Record isMonLaw T (e : T) (op : T -> T -> T) := {
opmA : forall a b c, op (op a b) c = op a (op b c);
op1m : forall x, op e x = x;
opm1 : forall x, op x e = x;
}.

HB.structure Definition MonLaw T e := { op of isMonLaw T e op }.

HB.mixin Record isPreMonoid T := {
zero : T;
add : T -> T -> T;
}.
HB.structure Definition PreMonoid := { T of isPreMonoid T }.

HB.structure Definition Monoid :=
{ T of isPreMonoid T &
isMonLaw T (@zero (PreMonoid.clone T _)) (@add (PreMonoid.clone T _)) }.