Samson Abramsky
1993
Computational Interpretations of Linear Logic
Theor. Comput. Sci.
111
1&2
3–57
10.1016/0304-3975(93)90181-R
Samson Abramsky
1994
Proofs as Processes
Theor. Comput. Sci.
135
1
5–9
10.1016/0304-3975(94)00103-0
Jean-Marc Andreoli
1992
Logic Programming with Focusing Proofs in Linear Logic
J. Log. Comput.
2
3
297–347
10.1093/logcom/2.3.297
P. N. Benton
Gavin M. Bierman
Valeria de Paiva
Martin Hyland
1993
A Term Calculus for Intuitionistic Linear Logic
TLCA
Lecture Notes in Computer Science
664
Springer
75–90
10.1007/BFb0037099
Michele Boreale
1998
On the Expressiveness of Internal Mobility in Name-Passing Calculi
Theor. Comput. Sci.
195
2
205–226
10.1016/S0304-3975(97)00220-X
Luís Caires
Jorge A. Pérez
2017
Linearity, Control Effects, and Behavioral Types
ESOP
Lecture Notes in Computer Science
10201
Springer
229–259
10.1007/978-3-662-54434-1_9
Luís Caires
Jorge A. Pérez
Frank Pfenning
Bernardo Toninho
2019
Domain-Aware Session Types
CONCUR
LIPIcs
140
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
39:1–39:17
10.4230/LIPIcs.CONCUR.2019.39
Luís Caires
Frank Pfenning
2010
Session Types as Intuitionistic Linear Propositions
Paul Gastin
François Laroussinie
CONCUR 2010
LNCS
6269
Springer
222–236
10.1007/978-3-642-15375-4_16
Luís Caires
Frank Pfenning
Bernardo Toninho
2016
Linear logic propositions as session types
Math. Struct. Comput. Sci.
26
3
367–423
10.1017/S0960129514000218
Sara Capecchi
Ilaria Castellani
Mariangiola Dezani-Ciancaglini
2016
Information flow safety in multiparty sessions
Math. Struct. Comput. Sci.
26
8
1352–1394
10.1017/S0960129514000619
Kaustuv Chaudhuri
Joëlle Despeyroux
Carlos Olarte
Elaine Pimentel
2019
Hybrid linear logic, revisited
Math. Struct. Comput. Sci.
29
8
1151–1176
10.1017/S0960129518000439
Mario Coppo
Mariangiola Dezani-Ciancaglini
Luca Padovani
Nobuko Yoshida
2015
A Gentle Introduction to Multiparty Asynchronous Session Types
SFM
LNCS
9104
Springer
146–178
10.1007/978-3-319-18941-3_4
Vincent Danos
Jean-Baptiste Joinet
Harold Schellinx
1993
The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs
Kurt Gödel Colloquium
Lecture Notes in Computer Science
713
Springer
159–171
10.1007/BFb0022564
Rowan Davies
Frank Pfenning
2001
A modal analysis of staged computation
J. ACM
48
3
555–604
10.1145/382780.382785
Joëlle Despeyroux
Kaustuv Chaudhuri
2013
A Hybrid Linear Logic for Constrained Transition Systems
TYPES
LIPIcs
26
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
150–168
10.4230/LIPIcs.TYPES.2013.150
Henry DeYoung
Luís Caires
Frank Pfenning
Bernardo Toninho
2012
Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication
CSL
LIPIcs
16
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
228–242
10.4230/LIPIcs.CSL.2012.228
Mariangiola Dezani-Ciancaglini
Ugo de'Liguoro
2009
Sessions and Session Types: An Overview
WS-FM
Lecture Notes in Computer Science
6194
Springer
1–28
10.1007/978-3-642-14458-5_1
Jean-Yves Girard
1987
Linear Logic
Theoretical Computer Science
50
1–102
10.1016/0304-3975(87)90045-4
Timothy Griffin
1990
A Formulae-as-Types Notion of Control
POPL
ACM Press
47–58
10.1145/96709.96714
Kohei Honda
Vasco Thudichum Vasconcelos
Makoto Kubo
1998
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP
Lecture Notes in Computer Science
1381
Springer
122–138
10.1007/BFb0053567
Hans Hüttel
Ivan Lanese
Vasco T. Vasconcelos
Luís Caires
Marco Carbone
Pierre-Malo Deniélou
Dimitris Mostrous
Luca Padovani
António Ravara
Emilio Tuosto
Hugo Torres Vieira
Gianluigi Zavattaro
2016
Foundations of Session Types and Behavioural Contracts
ACM Comput. Surv.
49
1
3:1–3:36
10.1145/2873052
Delia Kesner
Pierre Vial
2020
Non-idempotent types for classical calculi in natural deduction style
Log. Methods Comput. Sci.
16
1
10.23638/LMCS-16(1:3)2020
Björn Lellmann
Carlos Olarte
Elaine Pimentel
2017
A uniform framework for substructural logics with modalities
LPAR
EPiC Series in Computing
46
EasyChair
435–455
10.29007/93qg
Dale Miller
Gopalan Nadathur
Andre Scedrov
1987
Hereditary Harrop Formulas and Uniform Proof Systems
LICS
IEEE Computer Society
98–105
Robin Milner
Joachim Parrow
David Walker
1992
A Calculus of Mobile Processes, I
Inf. Comput.
100
1
1–40
10.1016/0890-5401(92)90008-4
Aleksandar Nanevski
Frank Pfenning
Brigitte Pientka
2008
Contextual modal type theory
ACM Trans. Comput. Log.
9
3
23:1–23:49
10.1145/1352582.1352591
Daniele Nantes
Jorge A. Pérez
2018
Relating Process Languages for Security and Communication Correctness (Extended Abstract)
FORTE
Lecture Notes in Computer Science
10854
Springer
79–100
10.1007/978-3-319-92612-4_5
Vivek Nigam
Dale Miller
2009
Algorithmic specifications in linear logic with subexponentials
PPDP
ACM
129–140
10.1145/1599410.1599427
Vivek Nigam
Carlos Olarte
Elaine Pimentel
2017
On subexponentials, focusing and modalities in concurrent systems
Theor. Comput. Sci.
693
35–58
10.1016/j.tcs.2017.06.009
Carlos Olarte
Elaine Pimentel
Vivek Nigam
2015
Subexponential concurrent constraint programming
Theor. Comput. Sci.
606
98–120
10.1016/j.tcs.2015.06.031
Michel Parigot
1992
Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR
Lecture Notes in Computer Science
624
Springer
190–201
10.1007/BFb0013061
Elaine Pimentel
Carlos Olarte
Vivek Nigam
2014
A Proof Theoretic Study of Soft Concurrent Constraint Programming
Theory Pract. Log. Program.
14
4-5
649–663
10.1017/S147106841400026X
Davide Sangiorgi
1996
pi-Calculus, Internal Mobility, and Agent-Passing Calculi
Theor. Comput. Sci.
167
1&2
235–274
10.1016/0304-3975(96)00075-8
Morten Heine B. SÃŗensen
Pawel Urzyczyn
2006
Lectures on the Curry-Howard Isomorphism
Studies in Logic and the Foundations of Mathematics
149
Elsevier Science
Kaku Takeuchi
Kohei Honda
Makoto Kubo
1994
An Interaction-based Language and its Typing System
PARLE
LNCS
817
Springer
398–413
10.1007/3-540-58184-7_118
Bernardo Toninho
Luís Caires
Frank Pfenning
2012
Functions as Session-Typed Processes
Lars Birkedal
FOSSACS 2012
LNCS
7213
Springer
346–360
10.1007/978-3-642-28729-9_23
Anne S. Troelstra
1992
Lectures on Linear Logic
CSLI Lecture Notes 29, Center for the Study of Language and Information
Stanford, California