Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
I
iris-coq
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Incidents
Environments
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Marianna Rapoport
iris-coq
Commits
24710264
Commit
24710264
authored
Oct 27, 2017
by
Ralf Jung
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
changelog and comments
parent
f5a5f1f1
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
6 additions
and
0 deletions
+6
-0
CHANGELOG.md
CHANGELOG.md
+1
-0
theories/base_logic/primitive.v
theories/base_logic/primitive.v
+5
-0
No files found.
CHANGELOG.md
View file @
24710264
...
...
@@ -7,6 +7,7 @@ Coq development, but not every API-breaking change is listed. Changes marked
Changes in and extensions of the theory:
*
[#] Add new modality: ■ ("plainly").
*
[#] Camera morphisms have to be homomorphisms, not just monotone functions.
*
[#] A proof that
`f`
has a fixed point if
`f^k`
is contractive.
*
Constructions for least and greatest fixed points over monotone predicates
...
...
theories/base_logic/primitive.v
View file @
24710264
...
...
@@ -97,6 +97,9 @@ Definition uPred_wand {M} := unseal uPred_wand_aux M.
Definition
uPred_wand_eq
:
@
uPred_wand
=
@
uPred_wand_def
:
=
seal_eq
uPred_wand_aux
.
(* Equivalently, this could be `∀ y, P n y`. That's closer to the intuition
of "embedding the step-indexed logic in Iris", but the two are equivalent
because Iris is afine. The following is easier to work with. *)
Program
Definition
uPred_plainly_def
{
M
}
(
P
:
uPred
M
)
:
uPred
M
:
=
{|
uPred_holds
n
x
:
=
P
n
ε
|}.
Solve
Obligations
with
naive_solver
eauto
using
uPred_closed
,
ucmra_unit_validN
.
...
...
@@ -480,6 +483,8 @@ Proof.
by
rewrite
cmra_core_l
cmra_core_idemp
.
Qed
.
(* The following two laws are very similar, and indeed they hold not just for □
and ■, but for any modality defined as `M P n x := ∀ y, R x y → P n y`. *)
Lemma
persistently_impl_plainly
P
Q
:
(
■
P
→
□
Q
)
⊢
□
(
■
P
→
Q
).
Proof
.
unseal
;
split
=>
/=
n
x
?
HPQ
n'
x'
????.
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment