Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
stdpp
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Gregory Malecha
stdpp
Commits
a5ee0c16
Commit
a5ee0c16
authored
5 years ago
by
Ralf Jung
Browse files
Options
Downloads
Patches
Plain Diff
move coPset-generic hint to coPset.v
parent
1f223f8f
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
theories/coPset.v
+1
-0
1 addition, 0 deletions
theories/coPset.v
theories/namespaces.v
+0
-4
0 additions, 4 deletions
theories/namespaces.v
with
1 addition
and
4 deletions
theories/coPset.v
+
1
−
0
View file @
a5ee0c16
...
...
@@ -159,6 +159,7 @@ Instance coPset_singleton : Singleton positive coPset := λ p,
Instance
coPset_elem_of
:
ElemOf
positive
coPset
:=
λ
p
X
,
e_of
p
(
`
X
)
.
Instance
coPset_empty
:
Empty
coPset
:=
coPLeaf
false
↾
I
.
Instance
coPset_top
:
Top
coPset
:=
coPLeaf
true
↾
I
.
Hint
Resolve
(
top_subseteq
(
A
:=
positive
)
(
C
:=
coPset
))
:
core
.
Instance
coPset_union
:
Union
coPset
:=
λ
X
Y
,
let
(
t1
,
Ht1
)
:=
X
in
let
(
t2
,
Ht2
)
:=
Y
in
(
t1
∪
t2
)
↾
coPset_union_wf
_
_
Ht1
Ht2
.
...
...
This diff is collapsed.
Click to expand it.
theories/namespaces.v
+
0
−
4
View file @
a5ee0c16
...
...
@@ -85,10 +85,6 @@ Hint Resolve (union_least (A:=positive) (C:=coPset)) : ndisj.
Hint
Resolve
(
subseteq_difference_l
(
A
:=
positive
)
(
C
:=
coPset
))
|
100
:
ndisj
.
Hint
Resolve
nclose_subseteq'
|
100
:
ndisj
.
(** Put this hint in [core] so that only only [solve_ndisj], but also [done] and
friends, can solve trivial goals of the form [E ⊆ ⊤] that occur often. *)
Hint
Resolve
(
top_subseteq
(
A
:=
positive
)
(
C
:=
coPset
))
:
core
.
(** Rules for goals of the form [_ ## _] *)
(** The base rule that we want to ultimately get down to. *)
Hint
Extern
0
(_
##
_)
=>
apply
ndot_ne_disjoint
;
congruence
:
ndisj
.
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment