Skip to content

Commit

Permalink
Use primitive projections, use qualified imports
Browse files Browse the repository at this point in the history
  • Loading branch information
artagnon committed Feb 6, 2024
1 parent ac3d456 commit f5f42f9
Show file tree
Hide file tree
Showing 6 changed files with 27 additions and 11 deletions.
16 changes: 15 additions & 1 deletion .vscode/settings.json
Original file line number Diff line number Diff line change
Expand Up @@ -5,5 +5,19 @@
],
"spellright.documentTypes": [
"latex",
]
],
"files.exclude": {
"**/*.vo": true,
"**/*.vok": true,
"**/*.vos": true,
"**/*.aux": true,
"**/*.glob": true,
"**/.git": true,
"**/.svn": false,
"**/.hg": false,
"**/CVS": false,
"**/.DS_Store": true,
"**/Thumbs.db": true,
"**/.ruby-lsp": true
}
}
3 changes: 2 additions & 1 deletion theories/νType/HSet.v
Original file line number Diff line number Diff line change
Expand Up @@ -2,8 +2,9 @@

Require Import Logic.FunctionalExtensionality.
Require Import Logic.Eqdep_dec. (* UIP_refl_unit *)
Require Import Notation.
From Bonak Require Import Notation.

Set Primitive Projections.
Set Universe Polymorphism.

Record HSet := {
Expand Down
2 changes: 1 addition & 1 deletion theories/νType/LeInductive.v
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
Require Import Notation.
From Bonak Require Import Notation.

(** An inductive definition of le *)
Reserved Infix "<~" (at level 70).
Expand Down
4 changes: 2 additions & 2 deletions theories/νType/LeYoneda.v
Original file line number Diff line number Diff line change
Expand Up @@ -2,8 +2,8 @@
- Recursive definition
- "Yoneda trick" *)

Require Import Notation.
Require Import LeInductive.
From Bonak Require Import Notation.
From Bonak Require Import LeInductive.

Set Warnings "-notation-overridden".

Expand Down
2 changes: 1 addition & 1 deletion theories/νType/RewLemmas.v
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
(** A few rewriting lemmas not in the standard library *)

Import Logic.EqNotations.
Require Import Notation.
From Bonak Require Import Notation.

Lemma rew_rew {A} {x y: A} (H : x = y) P {a: P x} :
rew <- [P] H in rew [P] H in a = a.
Expand Down
11 changes: 6 additions & 5 deletions theories/νType/νType.v
Original file line number Diff line number Diff line change
Expand Up @@ -4,15 +4,16 @@

Import Logic.EqNotations.
Require Import Logic.FunctionalExtensionality.
Require Import Notation.
Require Import RewLemmas.
From Bonak Require Import Notation.
From Bonak Require Import RewLemmas.

(* Note: this import overrides { & } notation and introduces hforall *)
Set Warnings "-notation-overridden".
Require Import HSet.
From Bonak Require Import HSet.

Require Import LeYoneda.
From Bonak Require Import LeYoneda.

Set Primitive Projections.
Set Printing Projections.
Set Keyed Unification.
Remove Printing Let sigT.
Expand Down Expand Up @@ -525,7 +526,7 @@ Proof.
simpl (mkFrame p.+1). unfold mkPaintingPrev, painting''.
change (fun x => C.(PaintingPrev).(painting') (Hp := ?Hp) (D := ?D) x) with
(C.(PaintingPrev).(painting') (Hp := Hp) (D := D)).
unfold mkFrameSp; unfold cohFrame at -1.
unfold mkFrameSp, cohFrame.
rewrite rew_map with (P := fun x => (C.(PaintingPrev).(painting') x).(Dom))
(f := fun x => rew <- [id] C.(eqFrameSp') in x).
repeat rewrite rew_compose.
Expand Down

0 comments on commit f5f42f9

Please sign in to comment.