Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Iris
RefinedC
Commits
b2a8a82c
Commit
b2a8a82c
authored
Jul 27, 2021
by
Michael Sammler
Browse files
update Iris
parent
be12317e
Pipeline
#51177
failed with stage
in 20 minutes and 50 seconds
Changes
3
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
refinedc.opam
View file @
b2a8a82c
...
...
@@ -17,7 +17,7 @@ dev-repo: "git+https://gitlab.mpi-sws.org/iris/refinedc.git"
depends: [
"coq" { (>= "8.12.0" & < "8.13~") }
"coq-iris" { (= "dev.2021-07-
07.0.ba841bb0
") | (= "dev") }
"coq-iris" { (= "dev.2021-07-
26.8.eb05e835
") | (= "dev") }
"dune" {>= "2.7.0"}
"cerberus" {= "~dev"}
"cmdliner" {>= "1.0.4"}
...
...
theories/lang/heap.v
View file @
b2a8a82c
...
...
@@ -693,7 +693,7 @@ Lemma heap_update_alloc_alive_in_heap σ a v1 v2 Paid Plk faid flk:
Proof
.
move
=>
H
Hlookup
Hfaid
Hlen
id
al
/=
Hal
Halive
p
Hp
.
destruct
(
decide
(
a
≤
p
<
a
+
length
v2
)).
-
rewrite
heap_update_lookup_in_range
//=.
by
eexists
.
-
rewrite
heap_update_lookup_in_range
//=.
-
rewrite
heap_update_lookup_not_in_range
;
last
lia
.
by
eapply
H
.
Qed
.
...
...
theories/lithium/base.v
View file @
b2a8a82c
...
...
@@ -500,34 +500,6 @@ End list_subequiv.
Typeclasses
Opaque
list_subequiv
.
Global
Opaque
list_subequiv
.
(** * big_andM *)
Reserved
Notation
"'[∧' 'map]' k ↦ x ∈ m , P"
(
at
level
200
,
m
at
level
10
,
k
,
x
at
level
1
,
right
associativity
,
format
"[∧ map] k ↦ x ∈ m , P"
).
Reserved
Notation
"'[∧' 'map]' x ∈ m , P"
(
at
level
200
,
m
at
level
10
,
x
at
level
1
,
right
associativity
,
format
"[∧ map] x ∈ m , P"
).
Notation
"'[∧' 'map]' k ↦ x ∈ m , P"
:
=
(
big_opM
bi_and
(
λ
k
x
,
P
)
m
)
:
bi_scope
.
Notation
"'[∧' 'map]' x ∈ m , P"
:
=
(
big_opM
bi_and
(
λ
_
x
,
P
)
m
)
:
bi_scope
.
Section
bi_big_op
.
Context
{
PROP
:
bi
}.
Implicit
Types
P
Q
:
PROP
.
Implicit
Types
Ps
Qs
:
list
PROP
.
Implicit
Types
A
:
Type
.
Section
map
.
Context
`
{
Countable
K
}
{
A
:
Type
}.
Implicit
Types
m
:
gmap
K
A
.
Implicit
Types
Φ
Ψ
:
K
→
A
→
PROP
.
Lemma
big_andM_empty
Φ
:
([
∧
map
]
k
↦
y
∈
∅
,
Φ
k
y
)
⊣
⊢
True
.
Proof
.
by
rewrite
big_opM_empty
.
Qed
.
Lemma
big_andM_insert
Φ
m
i
x
:
m
!!
i
=
None
→
([
∧
map
]
k
↦
y
∈
<[
i
:
=
x
]>
m
,
Φ
k
y
)
⊣
⊢
Φ
i
x
∧
[
∧
map
]
k
↦
y
∈
m
,
Φ
k
y
.
Proof
.
apply
big_opM_insert
.
Qed
.
End
map
.
End
bi_big_op
.
(** * big_op *)
Section
big_op
.
Context
{
PROP
:
bi
}.
...
...
Write
Preview
Supports
Markdown
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