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
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
Rice Wine
Iris
Commits
12f8178f
Commit
12f8178f
authored
Sep 24, 2017
by
Robbert Krebbers
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Steps are preserved by permutations.
parent
ae510d09
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
12 additions
and
2 deletions
+12
-2
opam
opam
+1
-1
opam.pins
opam.pins
+1
-1
theories/program_logic/language.v
theories/program_logic/language.v
+10
-0
No files found.
opam
View file @
12f8178f
...
...
@@ -12,5 +12,5 @@ remove: ["sh" "-c" "rm -rf '%{lib}%/coq/user-contrib/iris'"]
depends: [
"coq" { >= "8.6.1" & < "8.8~" }
"coq-mathcomp-ssreflect" { (>= "1.6.1" & < "1.7~") | (= "dev") }
"coq-stdpp" { (= "dev.2017-09-2
1.2
") | (= "dev") }
"coq-stdpp" { (= "dev.2017-09-2
4.0
") | (= "dev") }
]
opam.pins
View file @
12f8178f
coq-stdpp https://gitlab.mpi-sws.org/robbertkrebbers/coq-stdpp
2f9f3d3f28aa568f5cbee1be5699f163800491c0
coq-stdpp https://gitlab.mpi-sws.org/robbertkrebbers/coq-stdpp
4ea9c34a9c58a13aae97b4cc7f75fc862bdfcc7c
theories/program_logic/language.v
View file @
12f8178f
...
...
@@ -83,4 +83,14 @@ Section language.
Lemma
irreducible_fill
`
{
LanguageCtx
Λ
K
}
e
σ
:
to_val
e
=
None
→
irreducible
e
σ
→
irreducible
(
K
e
)
σ
.
Proof
.
rewrite
-!
not_reducible
.
naive_solver
eauto
using
reducible_fill
.
Qed
.
Lemma
step_Permutation
(
t1
t1'
t2
:
list
(
expr
Λ
))
σ
1
σ
2
:
t1
≡
ₚ
t1'
→
step
(
t1
,
σ
1
)
(
t2
,
σ
2
)
→
∃
t2'
,
t2
≡
ₚ
t2'
∧
step
(
t1'
,
σ
1
)
(
t2'
,
σ
2
).
Proof
.
intros
Ht
[
e1
σ
1
'
e2
σ
2
'
efs
tl
tr
??
Hstep
]
;
simplify_eq
/=.
move
:
Ht
;
rewrite
-
Permutation_middle
(
symmetry_iff
(
≡
ₚ
)).
intros
(
tl'
&
tr'
&->&
Ht
)%
Permutation_cons_inv
.
exists
(
tl'
++
e2
::
tr'
++
efs
)
;
split
;
[|
by
econstructor
].
by
rewrite
-!
Permutation_middle
!
assoc_L
Ht
.
Qed
.
End
language
.
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