Samson Abramsky
1994
Proofs as processes
Theoretical Computer Science
135
1
5–9
10.1016/0304-3975(94)00103-0
http://www.sciencedirect.com/science/article/pii/0304397594001030
Steffen van Bakel
Luca Cardelli
Maria Grazia Vigliotti
2014
Classical cut-elimination in the π-calculus
Emmanuel Beffara
2006
A concurrent model for linear logic
21st International Conference on Mathematical Foundations of Programming Semantics (MFPS)
Electronic Notes in Theoretical Computer Science
155
147–168
10.1016/j.entcs.2005.11.055
Emmanuel Beffara
François Maurel
2006
Concurrent nets: A study of prefixing in process calculi
Theoretical Computer Science
356
3
356–373
10.1016/j.tcs.2006.02.009
http://www.sciencedirect.com/science/article/pii/S0304397506001460
Emmanuel Beffara
Virgile Mogbil
2012
Proofs as executions
Jos C. M. Baeten
Tom Ball
Frank S. de Boer
Proceedings of IFIP TCS
Lecture Notes in Computer Science
7604
Springer
280–294
10.1007/978-3-642-33475-7_20
http://hal.archives-ouvertes.fr/hal-00586459/
Gianluigi Bellin
Philip J. Scott
1994
On the π-calculus and linear logic
Theoretical Computer Science
135
1
11–65
10.1016/0304-3975(94)00104-9
http://www.sciencedirect.com/science/article/pii/0304397594001049
Paola Bruscoli
2002
A purely logical account of sequentiality in proof search
Peter J. Stuckey
International Conference on Logic Programming (ICLP)
Lecture Notes in Computer Science
2401
Springer
302–316
10.1007/3-540-45619-8_21
http://link.springer.com/chapter/10.1007/3-540-45619-8_21
Luís Caires
Frank Pfenning
2010
Session types as intuitionistic linear propositions
Paul Gastin
François Laroussinie
Proceedings of the 21st International Conference on Concurrency Theory
Lecture Notes in Computer Science
6269
Springer Berlin Heidelberg
Paris, France
222–236
10.1007/978-3-642-15375-4_16
http://link.springer.com/chapter/10.1007/978-3-642-15375-4_16
Vincent Danos
Jean-Baptiste Joinet
Harold Schellinx
1997
A new deconstructive logic: linear logic
The Journal of Symbolic Logic
62
3
755–807
10.2307/2275572
http://www.jstor.org/stable/2275572
Vincent Danos
Laurent Regnier
1989
The structure of multiplicatives
Archive for Mathematical Logic
28
3
181–203
10.1007/BF01622878
http://link.springer.com/article/10.1007/BF01622878
Thomas Ehrhard
Olivier Laurent
2010
Interpreting a finitary π-calculus in differential interaction nets
Information and Computation
208
6
606–633
10.1016/j.ic.2009.06.005
http://www.sciencedirect.com/science/article/pii/S0890540110000155
Thomas Ehrhard
Laurent Regnier
2006
Differential interaction nets
Theoretical Computer Science
364
2
166–195
10.1016/j.tcs.2006.08.003
http://www.sciencedirect.com/science/article/pii/S0304397506005299
Jean-Yves Girard
1987
Linear logic
Theoretical Computer Science
50
1
1–101
10.1016/0304-3975(87)90045-4
http://www.sciencedirect.com/science/article/pii/0304397587900454
Jean-Yves Girard
1996
Proof-nets: the parallel syntax for proof-theory
Paolo Aglianò
Aldo Ursini
Logic and Algebra
Lecture Notes in Pure and Applied Mathematics
180
Marcel Dekker
New York
97–124
Matthew Hennessy
Robin Milner
1985
Algebraic laws for nondeterminism and concurrency
Journal of the ACM
32
1
137–161
10.1145/2455.2460
Kohei Honda
Olivier Laurent
2010
An exact correspondence between a typed π-calculus and polarised proof-nets
Theoretical Computer Science
411
2224
2223–2238
10.1016/j.tcs.2010.01.028
http://www.sciencedirect.com/science/article/pii/S0304397510000538
Cosimo Laneve
Björn Victor
2003
Solos in concert
Mathematical Structures in Computer Science
13
5
657–683
10.1017/S0960129503004055
François Maurel
2003
Nondeterministic light logics and NP time
Martin Hofmann
Typed Lambda Calculi and Applications
Lecture Notes in Computer Science
2701
Springer
241–255
10.1007/3-540-44904-3_17
http://link.springer.com/chapter/10.1007/3-540-44904-3_17
Dale Miller
1992
The π-calculus as a theory in linear logic: Preliminary results
Evelina Lamma
Paola Mello
Extensions of Logic Programming, Third International Workshop (WELP'92)
Lecture Notes in Computer Science
660
Springer
242–264
10.1007/3-540-56454-3_13
http://link.springer.com/chapter/10.1007/3-540-56454-3_13
Dale Miller
Alwen Tiu
2005
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
6
4
749783
10.1145/1094622.1094628
Robin Milner
1989
Communication and concurrency
Prentice-Hall, Inc.
Upper Saddle River, NJ, USA
Virgile Mogbil
2010
Non-deterministic boolean proof nets
Marko van Eekelen
Olha Shkaravska
Foundational and Practical Aspects of Resource Analysis
Lecture Notes in Computer Science
Springer
131–145
10.1007/978-3-642-15331-0_9
http://link.springer.com/chapter/10.1007/978-3-642-15331-0_9
Kazushige Terui
2004
Proof nets and boolean circuits
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
LICS '04
IEEE Computer Society
Washington, DC, USA
182191
10.1109/LICS.2004.34
Alwen Tiu
Dale Miller
2005
A proof search specification of the π-calculus
Electronic Notes in Theoretical Computer Science
138
1
79–101
10.1016/j.entcs.2005.05.006
http://www.sciencedirect.com/science/article/pii/S1571066105051121
Glynn Winskel
1987
Event structures
W. Brauer
W. Reisig
G. Rozenberg
Petri Nets: Applications and Relationships to Other Models of Concurrency
Lecture Notes in Computer Science
255
Springer Berlin Heidelberg
325–392
10.1007/3-540-17906-2_31
http://link.springer.com/chapter/10.1007/3-540-17906-2_31
Nobuko Yoshida
Martin Berger
Kohei Honda
2001
Strong normalisation in the π-calculus
16th Annual IEEE Symposium on Logic in Computer Science, 2001.
311–322
10.1109/LICS.2001.932507