Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
C
cfml
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
Operations
Operations
Incidents
Packages & Registries
Packages & Registries
Container Registry
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
CHARGUERAUD Arthur
cfml
Commits
922bc91b
Commit
922bc91b
authored
Dec 04, 2017
by
charguer
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
extra
parent
edea7903
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
21 additions
and
21 deletions
+21
-21
attic/ExtraModelRO.v
attic/ExtraModelRO.v
+21
-0
model/LambdaSepRO.v
model/LambdaSepRO.v
+0
-21
No files found.
attic/ExtraModelRO.v
View file @
922bc91b
Lemma
normally_idempotent2
:
forall
H
,
normally
(
normally
H
)
==>
normally
H
.
Proof
using
.
intros
.
unfold
normally
at
1.
hpull
;
=>
H1
H2
N1
R
.
asserts
E
:
(
\
[]
==>
RO
H2
).
(
*
equivalent
to
[
RO
H2
hempty
]
*
)
{
intros
h
M
.
rewrites
(
hempty_inv
(
rm
M
)).
(
*
This
is
almost
true
.
I
think
we
would
need
to
know
that
H2
is
not
[
False
],
i
.
e
.
that
at
least
one
heap
satisfies
[
RO
H2
]
in
order
to
conclude
.
We
might
try
to
add
\
[
exists
h2
,
RO
H2
h2
],
or
equivalently
\
[
~
(
RO
H2
==>
\
[
False
])
]
to
the
definition
.
*
)
admit
.
}
hchange
E
.
hchanges
R
.
Abort
.
(
*
It
this
was
true
,
we
would
have
a
proper
idempotence
result
:
[(
normally
(
normally
H
))
=
normally
H
]
*
)
End
Normally
.
Program
Definition
normally
'
H
h1
:=
(
*
alternative
*
)
exists
h2
,
heap_compat
h1
h2
/
\
h1
^
r
=
fmap_empty
...
...
model/LambdaSepRO.v
View file @
922bc91b
...
...
@@ -1307,27 +1307,6 @@ Proof using.
intros
.
applys
normally_intro
.
applys
normal_normally
.
Qed
.
Lemma
normally_idempotent2
:
forall
H
,
normally
(
normally
H
)
==>
normally
H
.
Proof
using
.
intros
.
unfold
normally
at
1.
hpull
;
=>
H1
H2
N1
R
.
asserts
E
:
(
\
[]
==>
RO
H2
).
(
*
equivalent
to
[
RO
H2
hempty
]
*
)
{
intros
h
M
.
rewrites
(
hempty_inv
(
rm
M
)).
(
*
This
is
almost
true
.
I
think
we
would
need
to
know
that
H2
is
not
[
False
],
i
.
e
.
that
at
least
one
heap
satisfies
[
RO
H2
]
in
order
to
conclude
.
We
might
try
to
add
\
[
exists
h2
,
RO
H2
h2
],
or
equivalently
\
[
~
(
RO
H2
==>
\
[
False
])
]
to
the
definition
.
*
)
admit
.
}
hchange
E
.
hchanges
R
.
Abort
.
(
*
It
this
was
true
,
we
would
have
a
proper
idempotence
result
:
[(
normally
(
normally
H
))
=
normally
H
]
*
)
End
Normally
.
(
*
----------------------------------------------------------------------
*
)
...
...
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