Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
What's new
10
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Open sidebar
Iris
Iris
Commits
abaf388a
Commit
abaf388a
authored
Jun 28, 2016
by
Robbert Krebbers
Browse files
Options
Browse Files
Download
Plain Diff
Merge branch 'master' of gitlab.mpi-sws.org:FP/iris-coq
parents
1aae01e6
4c056f5e
Pipeline
#1683
passed with stage
Changes
3
Pipelines
1
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
23 additions
and
1 deletion
+23
-1
_CoqProject
_CoqProject
+1
-0
algebra/count.v
algebra/count.v
+21
-0
heap_lang/lang.v
heap_lang/lang.v
+1
-1
No files found.
_CoqProject
View file @
abaf388a
...
...
@@ -55,6 +55,7 @@ algebra/upred_tactics.v
algebra/upred_big_op.v
algebra/upred_hlist.v
algebra/frac.v
algebra/count.v
algebra/csum.v
algebra/list.v
algebra/updates.v
...
...
algebra/count.v
0 → 100644
View file @
abaf388a
From
iris
.
algebra
Require
Export
cmra
.
From
iris
.
algebra
Require
Import
upred
.
Notation
count
:
=
nat
(
only
parsing
).
Section
count
.
Canonical
Structure
countC
:
=
leibnizC
count
.
Instance
count_valid
:
Valid
count
:
=
λ
_
,
True
.
Instance
count_pcore
:
PCore
count
:
=
λ
_
,
None
.
Instance
count_op
:
Op
count
:
=
λ
x
y
,
(
x
+
y
)%
nat
.
Definition
count_ra_mixin
:
RAMixin
nat
.
Proof
.
by
split
;
try
apply
_
.
Qed
.
Canonical
Structure
countR
:
=
discreteR
count
count_ra_mixin
.
End
count
.
(** Internalized properties *)
Lemma
count_equivI
{
M
}
(
x
y
:
count
)
:
x
≡
y
⊣
⊢
(
x
=
y
:
uPred
M
).
Proof
.
by
uPred
.
unseal
.
Qed
.
Lemma
count_validI
{
M
}
(
x
:
count
)
:
✓
x
⊣
⊢
(
True
:
uPred
M
).
Proof
.
by
uPred
.
unseal
.
Qed
.
heap_lang/lang.v
View file @
abaf388a
...
...
@@ -34,7 +34,7 @@ Proof.
Qed
.
(** A typeclass for whether a variable is bound in a given
context. Making this a typeclass means we can use tpeclass search
context. Making this a typeclass means we can use t
y
peclass search
to program solving these constraints, so this becomes extensible.
Also, since typeclass search runs *after* unification, Coq has already
inferred the X for us; if we were to go for embedded proof terms ot
...
...
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