|
Journals in DBLP
- Samson Abramsky
Proofs as Processes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:135, n:1, pp:5-9 [Journal]
- Gianluigi Bellin, Philip J. Scott
On the pi-Calculus and Linear Logic. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:135, n:1, pp:11-65 [Journal]
- Didier Galmiche, Guy Perrier
On Proof Normalization in Linear Logic. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:135, n:1, pp:67-110 [Journal]
- Gianfranco Mascari, Marco Pedicini
Head Linear Reduction and Pure Proof Net Extraction. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:135, n:1, pp:111-137 [Journal]
- Patrick Lincoln, Andre Scedrov
First-Order Linear Logic without Modalities is NEXPTIME-Hard. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:135, n:1, pp:139-153 [Journal]
- Patrick Lincoln, Timothy C. Winkler
Constant-Only Multiplicative Linear Logic is NP-Complete. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:135, n:1, pp:155-169 [Journal]
|