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.

Sign up for GitHub

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

Adapt to https://github.com/coq/coq/pull/18224 #578

Merged
merged 1 commit into from
Mar 14, 2024
Merged

Adapt to https://github.com/coq/coq/pull/18224 #578

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
4 changes: 2 additions & 2 deletions examples/definterp.v
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -42,8 +42,8 @@ Notation "( x , .. , y , z )" :=
(right associativity, at level 0,
format "( x , .. , y , z )") : equations_scope.

Notation " x .1 " := (pr1 x) (at level 3, format "x .1") : equations_scope.
Notation " x .2 " := (pr2 x) (at level 3, format "x .2") : equations_scope.
Notation " x .1 " := (pr1 x) : equations_scope.
Notation " x .2 " := (pr2 x) : equations_scope.

Local Open Scope equations_scope.

Expand Down
4 changes: 2 additions & 2 deletions examples/polynomials.v
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -339,8 +339,8 @@ Definition apoly {n b} := existT (fun b => poly b n) b.
one case to inject an integer into a polynomial and in the
[poly_s], [poly_s] case to inspect a recursive call. *)

Notation " x .1 " := (projT1 x) (at level 3, format "x .1").
Notation " x .2 " := (projT2 x) (at level 3, format "x .2").
Notation " x .1 " := (projT1 x).
Notation " x .2 " := (projT2 x).

Equations plus {n} {b1} (p1 : poly b1 n) {b2} (p2 : poly b2 n) : { b : bool & poly b n } :=
plus poly_z poly_z := apoly poly_z;
Expand Down
6 changes: 3 additions & 3 deletions theories/Init.v
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -89,8 +89,8 @@
(right associativity, at level 0,
format "( x , .. , y , z )") : equations_scope.

Notation " x .1 " := (pr1 x) (at level 3, format "x .1") : equations_scope.
Notation " x .2 " := (pr2 x) (at level 3, format "x .2") : equations_scope.
Notation " x .1 " := (pr1 x) : equations_scope.

Check failure on line 92 in theories/Init.v

View workflow job for this annotation

GitHub Actions / build (dev, 4.09-flambda, local) 

A left-recursive notation must have an explicit level.

Check failure on line 92 in theories/Init.v

View workflow job for this annotation

GitHub Actions / build (dev, 4.09-flambda, hott) 

A left-recursive notation must have an explicit level.

Check failure on line 92 in theories/Init.v

View workflow job for this annotation

GitHub Actions / build (dev, 4.09-flambda, dune) 

A left-recursive notation must have an explicit level.
Notation " x .2 " := (pr2 x) : equations_scope.

End Sigma_Notations.

Expand Down Expand Up @@ -166,4 +166,4 @@
Ltac unfold_recursor_ext := fail "Equations.Init.unfold_recursor_ext has not been bound yet".

(** Forward reference to an internal tactic to combine eliminators for mutual and nested definitions *)
Ltac specialize_mutfix := fail "Equations.Init.specialize_mutfix has not been bound yet".
Ltac specialize_mutfix := fail "Equations.Init.specialize_mutfix has not been bound yet".
Loading