Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Theoretical Computer Science
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Communication and Concurrency
A Purely Logical Account of Sequentiality in Proof Search
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The pi-Calculus as a Theory in Linear Logic: Preliminary Results
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
Concurrent nets: a study of prefixing in process calculi
Theoretical Computer Science - Expressiveness in concurrency
Theoretical Computer Science - Logic, language, information and computation
A Proof Search Specification of the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Concurrent Model for Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Nondeterministic light logics and NP-time
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
Lolliproc: to concurrency from classical linear logic via curry-howard and control
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Non-deterministic Boolean proof nets
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Session types as intuitionistic linear propositions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Correctness of linear logic proof structures is NL-complete
Theoretical Computer Science
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
This paper proposes a new interpretation of the logical contents of programs in the context of concurrent interaction, wherein proofs correspond to valid executions of a processes. A type system based on linear logic is used, in which a given process has many different types, each typing corresponding to a particular way of interacting with its environment and cut elimination corresponds to executing the process in a given interaction scenario. A completeness result is established, stating that every lock-avoiding execution of a process in some environment corresponds to a particular typing. Besides traces, types contain precise information about the flow of control between a process and its environment, and proofs are interpreted as composable schedulings of processes. In this interpretation, logic appears as a way of making explicit the flow of causality between interacting processes.