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
Marianna Rapoport
iris-coq
Commits
fe66881e
Commit
fe66881e
authored
Aug 23, 2016
by
Ralf Jung
Browse files
docs: fix V being about any CMRA; fix V's timeless axiom
parent
62299a95
Changes
2
Hide whitespace changes
Inline
Side-by-side
docs/logic.tex
View file @
fe66881e
...
...
@@ -270,7 +270,7 @@ In writing $\vctx, x:\type$, we presuppose that $x$ is not already declared in $
\infer
{
\vctx
\proves
\wtt
{
\melt
}{
\textlog
{
M
}}}
{
\vctx
\proves
\wtt
{
\ownGGhost
{
\melt
}}{
\Prop
}}
\and
\infer
{
\vctx
\proves
\wtt
{
\melt
}{
\t
extlog
{
M
}
}}
\infer
{
\vctx
\proves
\wtt
{
\melt
}{
\t
ype
}
\and
\text
{$
\type
$
is a CMRA
}}
{
\vctx
\proves
\wtt
{
\mval
(
\melt
)
}{
\Prop
}}
\and
\infer
{
\vctx
\proves
\wtt
{
\state
}{
\textlog
{
State
}}}
...
...
@@ -464,7 +464,7 @@ A type $\type$ being \emph{inhabited} means that $ \proves \wtt{\term}{\type}$ i
{
\timeless
{
\ownGGhost\melt
}}
\infer
{
\text
{$
\melt
$
is a
discrete COFE element
}}
{
\text
{$
\melt
$
is a
n element of a discrete CMRA
}}
{
\timeless
{
\mval
(
\melt
)
}}
\infer
{}
...
...
docs/model.tex
View file @
fe66881e
...
...
@@ -40,8 +40,8 @@ We introduce an additional logical connective $\ownM\melt$, which will later be
\Lam
\melt
.
\setComp
{
n
}{
\begin{aligned}
\All
m,
\meltB
.
&
m
\leq
n
\land
\melt\mtimes\meltB
\in
\mval
_
m
\Ra
{}
\\
&
m
\in
\Sem
{
\vctx
\proves
\prop
:
\Prop
}_
\gamma
(
\meltB
)
\Ra
{}
\\
&
m
\in
\Sem
{
\vctx
\proves
\propB
:
\Prop
}_
\gamma
(
\melt\mtimes\meltB
)
\end{aligned}
}
\\
\Sem
{
\vctx
\proves
\ownM
{
\melt
}
:
\Prop
}_
\gamma
&
\eqdef
\Lam\meltB
.
\setComp
{
n
}{
\
melt
\mincl
[n]
\meltB
}
\\
\Sem
{
\vctx
\proves
\mval
(
\melt
) :
\Prop
}_
\gamma
&
\eqdef
\Lam\any
.
\setComp
{
n
}{
\
melt
\in
\mval
_
n
}
\\
\Sem
{
\vctx
\proves
\ownM
{
\melt
}
:
\Prop
}_
\gamma
&
\eqdef
\Lam\meltB
.
\setComp
{
n
}{
\
Sem
{
\vctx
\proves
\melt
:
\textlog
{
M
}}
\mincl
[n]
\meltB
}
\\
\Sem
{
\vctx
\proves
\mval
(
\melt
) :
\Prop
}_
\gamma
&
\eqdef
\Lam\any
.
\setComp
{
n
}{
\
Sem
{
\vctx
\proves
\melt
:
\type
}
\in
\mval
_
n
}
\\
\end{align*}
For every definition, we have to show all the side-conditions: The maps have to be non-expansive and monotone.
...
...
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