Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
I
iris-coq
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Janno
iris-coq
Commits
b6e2991e
Commit
b6e2991e
authored
9 years ago
by
Ralf Jung
Browse files
Options
Downloads
Patches
Plain Diff
change some metachars araound a little
parent
764f5144
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
docs/logic.tex
+0
-15
0 additions, 15 deletions
docs/logic.tex
docs/setup.tex
+7
-2
7 additions, 2 deletions
docs/setup.tex
with
7 additions
and
17 deletions
docs/logic.tex
+
0
−
15
View file @
b6e2991e
% CONVENTION:
% Use \Ra/Lra for the logic and \implies/\iff for the metalogic.
% This short (for now) note lays out a \emph{generic} separation logic which
% manages sharing through invariants and ownership through (partial commutative)
% monoids. The logic is generic in that the actual language it applies to is
% taken as a parameter, giving in particular the atomic (per-thread) reduction
% relation. Over this, we layer concurrency (by giving a semantics to \kw{fork}
% and lifting to thread pools). The generic logic provides numerous logical
% connectives and the semantics of Hoare triples and view shifts, together with a
% large portion of the proof theory---including, in particular, the structural
% rules for Hoare logic. Ultimately, these are proved sound relative to some
% simple assumptions about the language. It should be possible, moreover, to give
% a generic adequacy proof for Hoare triples as applied to the lifted thread-pool
% semantics.
\section
{
Parameters to the logic
}
...
...
This diff is collapsed.
Click to expand it.
docs/setup.tex
+
7
−
2
View file @
b6e2991e
...
...
@@ -277,7 +277,7 @@
%% LOGIC SYMBOLS & NOTATION & IDENTIFIERS
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\newcommand
{
\Sig
}{
\
Sigma
}
\newcommand
{
\Sig
}{
\
mathcal
{
S
}
}
\newcommand
{
\SigType
}{
\mathcal
{
T
}}
\newcommand
{
\SigFn
}{
\mathcal
{
F
}}
\newcommand
{
\sigfn
}{
F
}
...
...
@@ -292,7 +292,7 @@
\newcommand
{
\termB
}{
u
}
\newcommand
{
\termVal
}{
V
}
\newcommand
{
\sort
}{
\
s
igma
}
\newcommand
{
\sort
}{
\
S
igma
}
\newcommand
{
\vctx
}{
\Gamma
}
\newcommand
{
\pfctx
}{
\Theta
}
...
...
@@ -463,3 +463,8 @@
\newcommand
{
\AuthInv
}{
\textsf
{
AuthInv
}}
\newcommand
{
\Auth
}{
\textsf
{
Auth
}}
%%% Local Variables:
%%% mode: latex
%%% TeX-master: "iris"
%%% End:
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment