Theoretical Computer Science
Communication and concurrency
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Concurrency and plan generation in a logic programming language with a sequential operator
Proceedings of the eleventh international conference on Logic programming
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic 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
Non-commutativity and MELL in the Calculus of Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A Local System for Linear Logic
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Non-commutative Extension of MELL
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
MELL in the calculus of structures
Theoretical Computer Science
On structuring proof search for first order linear logic
Theoretical Computer Science
A system of interaction and structure
ACM Transactions on Computational Logic (TOCL)
On the proof complexity of deep inference
ACM Transactions on Computational Logic (TOCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Nested proof search as reduction in the Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Linear lambda calculus and deep inference
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Reducing nondeterminism in the calculus of structures
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
A strict correspondence between the proof-search space of a logical formal system and computations in a simple process algebra is established. Sequential composition in the process algebra corresponds to a logical relation in the formal system in this sense our approach is purely logical, no axioms or encodings are involved. The process algebra is a minimal restriction of CCS to parallel and sequential composition; the logical system is a minimal extension of multiplicative linear logic. This way we get the first purely logical account of sequentiality in proof search. Since we restrict attention to a small but meaningful fragment, which is then of very broad interest, our techniques should become a common basis for several possible extensions. In particular, we argue about this work being the first step in a two-step research for capturing most of CCS in a purely logical fashion.