Name
Abstract | ||
|---|---|---|
We introduce a notion of realizability for Classical Linear Logic, and describe a number of examples, including one based on concurrent games, and one based on the process calculus CCS. |
Year | Venue | Keywords |
|---|---|---|
2015 | Electronic Notes in Theoretical Computer Science | 03d65,linear logic,ccs,68q55,concurrency,process calculi,realizability,concurrent games,03b40,semantics |
DocType | Volume | Citations |
Journal | abs/1512.06233 | 1 |
PageRank | References | Authors |
0.35 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samson Abramsky | 1 | 3169 | 348.51 |