Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
E
examples
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
1
Issues
1
List
Boards
Labels
Milestones
Merge Requests
4
Merge Requests
4
CI / CD
CI / CD
Pipelines
Jobs
Schedules
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
Iris
examples
Commits
4e99180a
Commit
4e99180a
authored
Dec 17, 2017
by
Ralf Jung
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
fix README markdown better
parent
7cb3cd61
Pipeline
#5981
canceled with stage
Changes
1
Pipelines
3
Hide whitespace changes
Inline
Sidebyside
Showing
1 changed file
with
10 additions
and
10 deletions
+10
10
README.md
README.md
+10
10
No files found.
README.md
View file @
4e99180a
...
...
@@ 33,19 +33,19 @@ This repository contains the following case studies:
*
[
logrel
](
theories/logrel
)
: Logical relations from the
[
IPM paper
](
http://doi.acm.org/10.1145/3093333.3009855
)
:

STLC

Unary logical relations proving type safety

Unary logical relations proving type safety

F_mu (System F with recursive types)

Unary logical relations proving type safety

Unary logical relations proving type safety

F_mu_ref (System F with recursive types and references)

Unary logical relations proving type safety

Binary logical relations for proving contextual refinements

Unary logical relations proving type safety

Binary logical relations for proving contextual refinements

F_mu_ref_conc (System F with recursive types, references and concurrency)

Unary logical relations proving type safety

Binary logical relations for proving contextual refinements

Proof of refinement for a pair of finegrained/coarsegrained concurrent
counter implementations

Proof of refinement for a pair of finegrained/coarsegrained concurrent
stack implementations

Unary logical relations proving type safety

Binary logical relations for proving contextual refinements

Proof of refinement for a pair of finegrained/coarsegrained
concurrent
counter implementations

Proof of refinement for a pair of finegrained/coarsegrained
concurrent
stack implementations
*
[
spanningtree
](
theories/spanning_tree
)
: Proof of a concurrent spanning tree
algorithm.
*
[
lecturenotes
](
theories/lecture_notes
)
: Coq examples for the
...
...
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