Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
Iris
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Terraform modules
Monitor
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
Gaëtan Gilbert
Iris
Commits
f114858c
Commit
f114858c
authored
5 years ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
Comments for namespace_map.
parent
3076a654
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
theories/algebra/namespace_map.v
+18
-2
18 additions, 2 deletions
theories/algebra/namespace_map.v
with
18 additions
and
2 deletions
theories/algebra/namespace_map.v
+
18
−
2
View file @
f114858c
...
@@ -4,6 +4,18 @@ From iris.algebra Require Import updates.
...
@@ -4,6 +4,18 @@ From iris.algebra Require Import updates.
From
iris
.
algebra
Require
Import
proofmode_classes
.
From
iris
.
algebra
Require
Import
proofmode_classes
.
Set
Default
Proof
Using
"Type"
.
Set
Default
Proof
Using
"Type"
.
(** The camera [namespace_map A] over a camera [A] provides the connectives
[namespace_map_data N a], which associates data [a : A] with a namespace [N],
and [namespace_map_token E], which says that no data has been associated with
the namespaces in the mask [E]. The important properties of this camera are:
- The lemma [namespace_map_token_union] enables one to split [namespace_map_token]
w.r.t. disjoint union. That is, if we have [E1 ## E2], then we get
[namespace_map_token (E1 ∪ E2) = namespace_map_token E1 ⋅ namespace_map_token E2]
- The lemma [namespace_map_alloc_update] provides a frame preserving update to
associate data to a namespace [namespace_map_token E ~~> namespace_map_data N a]
provided [↑N ⊆ E] and [✓ a]. *)
Record
namespace_map
(
A
:
Type
)
:=
NamespaceMap
{
Record
namespace_map
(
A
:
Type
)
:=
NamespaceMap
{
namespace_map_data_proj
:
gmap
positive
A
;
namespace_map_data_proj
:
gmap
positive
A
;
namespace_map_token_proj
:
coPset_disj
namespace_map_token_proj
:
coPset_disj
...
@@ -83,14 +95,18 @@ Proof. intros. apply NamespaceMap_discrete; apply _. Qed.
...
@@ -83,14 +95,18 @@ Proof. intros. apply NamespaceMap_discrete; apply _. Qed.
Instance
namespace_map_valid
:
Valid
(
namespace_map
A
)
:=
λ
x
,
Instance
namespace_map_valid
:
Valid
(
namespace_map
A
)
:=
λ
x
,
match
namespace_map_token_proj
x
with
match
namespace_map_token_proj
x
with
|
CoPset
E
=>
|
CoPset
E
=>
✓
(
namespace_map_data_proj
x
)
∧
∀
i
,
namespace_map_data_proj
x
!!
i
=
None
∨
i
∉
E
✓
(
namespace_map_data_proj
x
)
∧
(* dom (namespace_map_data_proj x) ⊥ E *)
∀
i
,
namespace_map_data_proj
x
!!
i
=
None
∨
i
∉
E
|
CoPsetBot
=>
False
|
CoPsetBot
=>
False
end
.
end
.
Global
Arguments
namespace_map_valid
!
_
/.
Global
Arguments
namespace_map_valid
!
_
/.
Instance
namespace_map_validN
:
ValidN
(
namespace_map
A
)
:=
λ
n
x
,
Instance
namespace_map_validN
:
ValidN
(
namespace_map
A
)
:=
λ
n
x
,
match
namespace_map_token_proj
x
with
match
namespace_map_token_proj
x
with
|
CoPset
E
=>
|
CoPset
E
=>
✓
{
n
}
(
namespace_map_data_proj
x
)
∧
∀
i
,
namespace_map_data_proj
x
!!
i
=
None
∨
i
∉
E
✓
{
n
}
(
namespace_map_data_proj
x
)
∧
(* dom (namespace_map_data_proj x) ⊥ E *)
∀
i
,
namespace_map_data_proj
x
!!
i
=
None
∨
i
∉
E
|
CoPsetBot
=>
False
|
CoPsetBot
=>
False
end
.
end
.
Global
Arguments
namespace_map_validN
!
_
/.
Global
Arguments
namespace_map_validN
!
_
/.
...
...
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