S. Abramsky
1993
Computational Interpretations of Linear Logic
Theo. Comp. Sci.
111
1-2
3–57
10.1016/0304-3975(93)90181-R
K. Asai
Y. Kameyama
2007
Polymorphic Delimited Continuations
APLAS '07
LNCS
4807
Springer
239–254
10.1007/978-3-540-76637-7_16
A. Avron
1991
Hypersequents, logical consequence and intermediate logics for concurrency
Ann. Math. Artif. Intell.
4
225–248
10.1007/BF01531058
A. Avron
2000
A Tableau System for Gödel–Dummett Logic Based on a Hypersequent Calculus
TABLEAUX '00
LNCS
1847
Springer
98–111
10.1007/10722086_11
M. Baaz
A. Ciabattoni
C. G. Fermüller
2003
Hypersequent Calculi for Gödel Logics–a Survey
Journal of Logic and Computation
13
6
835–861
10.1093/logcom/13.6.835
D. Baelde
2012
Least and Greatest Fixed Points in Linear Logic
ACM Trans. Comput. Logic
13
1
2:1–2:44
10.1145/2071368.2071370
A. Bejleri
N. Yoshida
2009
Synchronous Multiparty Session Types
Electronic Notes in Theoretical Computer Science
241
0
3–33
10.1016/j.entcs.2009.06.002
R. Blute
P. Scott
2004
Category Theory for Linear Logicians
Linear Logic in Computer Science
316
3–65
10.1017/CBO9780511550850.002
L. Caires
F. Pfenning
2010
Session Types as Intuitionistic Linear Propositions
P. Gastin
F. Laroussinie
CONCUR 2010
LNCS
6269
Springer
222–236
10.1007/978-3-642-15375-4_16
E. Casari
1989
Comparative Logics and Abelian l-groups
R. Ferro
C. Bonotto
S. Valentini
A. Zanardo
Logic Colloquium '88
Studies in logic and the foundations of mathematics
127
North-Holland
161–190
10.1016/S0049-237X(08)70269-6
A. Ciabattoni
L. Straßburger
K. Terui
2009
Expanding the Realm of Systematic Proof Theory
CSL
163–178
10.1007/978-3-642-04027-6_14
O. Danvy
A. Filinski
1990
Abstracting control
Proceedings of the 1990 ACM conference on LISP and functional programming
LFP '90
ACM
151–160
10.1145/91556.91622
N. Galatos
P. Jipsen
T. Kowalski
H. Ono
2007
Residuated Lattices: An Algebraic Glimpse at Substructural Logics
1st
Studies in Logic and The Foundations of Mathematics
151
Elsevier
M. Giunti
V. T. Vasconcelos
2010
A Linear Account of Session Types in the Pi Calculus
CONCUR 2010
LNCS
Springer
432–446
10.1007/978-3-642-15375-4_30
Y. Hirai
2012
A Lambda Calculus for Gödel-Dummett Logic Capturing Waitfreedom
T. Schrijvers
P. Thiemann
Functional and Logic Programming
LNCS
7294
Springer
151–165
10.1007/978-3-642-29822-6_14
Y. Hirai
2013
Hyper-Lambda Calculi
Univ. of Tokyo
K. Honda
1993
Types for Dyadic Interaction
CONCUR '93
LNCS
715
Springer
509–523
10.1007/3-540-57208-2_35
K. Honda
N. Yoshida
M. Carbone
2008
Multiparty Asynchronous Session Types
POPL '08
POPL '08
ACM
273–284
10.1145/1328438.1328472
K. Imai
S. Yuen
K. Agusa
2010
Session Type Inference in Haskell
PLACES
74–91
10.4204/EPTCS.69.6
N. Kobayashi
B. C. Pierce
D. N. Turner
1999
Linearity and the pi-calculus
ACM Trans. Program. Lang. Syst.
21
5
914–947
10.1145/237721.237804
N. Kobayashi
A. Yonezawa
1995
Higher-Order Concurrent Linear Logic Programming
Theory and Practice of Parallel Programming
LNCS
907
Springer
137–166
10.1007/BFb0026568
F. Lamarche
2008
Proof Nets for Intuitionistic Linear Logic: essential nets
Technical Report
Loria & INRIA-Lorraine
S. Marlow
2010
Haskell 2010 Language Report
Available online http://www.haskell.org/onlinereport/haskell2010
G. Metcalfe
2006
Proof Theory for Casari's Comparative Logics
Journal of Logic and Computation
16
4
405–422
10.1093/logcom/exl001
G. Metcalfe
N. Olivetti
D. Gabbay
2002
Analytic Sequent Calculi for Abelian andŁ ukasiewicz Logics
U. Egly
C. Fermüller
TABLEAUX 2002
LNCS
2381
Springer
191–205
10.1007/3-540-45616-3_14
R. K. Meyer
J. K. Slaney
1989
Abelian Logic (from A to Z)
G. Priest
R. Richard
J. Norman
Paraconsistent Logic: Essays on the Inconsistent
IX
Philosophia Verlag
245–288
R. Milner
1978
A Theory of Type Polymorphism in Programming
Journal of Computer and System Sciences
17
3
348–375
10.1016/0022-0000(78)90014-4
R. Milner
1999
Communicating and Mobile Systems: the pi-calculus
Cambridge University Press
R. Milner
M. Tofte
R. Harper
D. MacQueen
1997
The definition of Standard ML
MIT press
A. S. Murawski
C. H. L. Ong
2003
Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit
Theoretical Computer Science
294
1-2
269–305
10.1016/S0304-3975(01)00244-4
J. Rees
W. Clinger
1986
Revised Report on the Algorithmic Language Scheme
SIGPLAN Not.
21
12
37–79
10.1145/15042.15043
M. Shirahata
A Sequent Calculus for Compact Closed Categories
K. Takeuchi
K. Honda
M. Kubo
An Interaction-Based Language and its Typing System
PARLE'94 Parallel Architectures and Languages Europe
398–413
10.1007/3-540-58184-7_118
T. Toffoli
1980
Reversible Computing
J. Bakker
J. Leeuwen
Automata, Languages and Programming
LNCS
85
Springer
632–644
10.1007/3-540-10003-2_104
P. Wadler
2012
Propositions as Sessions
Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming
ICFP '12
ACM
273–286
10.1145/2398856.2364568