Decision Problems for Propositional Linear Logic (1990)

by Patrick Lincoln , John Mitchell , Andre Scedrov , Natarajan Shankar
Citations:90 - 17 self

Documents Related by Co-Citation

306 Logic Programming in a Fragment of Intuitionistic Linear Logic – Joshua S. Hodas, Dale Miller
333 Logic Programming with Focusing Proofs in Linear Logic – Jean-marc Andreoli - 1992
24 programming in linear logic is NP-complete – Horn - 1992
205 Linear Objects: logical processes with built-in inheritance – Jean-Marc Andreoli, Remo Pareschi - 1990
67 From Petri Nets to Linear Logic – N Marti-Oliet, J Meseguer - 1991
30 Constant-Only Multiplicative Linear Logic is NP-Complete – Patrick Lincoln, Timothy Winkler - 1992
20 Logic programming with sequent systems: a linear logic approach – J-M Andreoli, R Pareschi - 1990
131 A game semantics for linear logic – A Blass
31 Normal process representatives – V Gehlot, C Gunter - 1990
42 Proof Search in the Intuitionistic Sequent Calculus – N. Shankar - 1991
44 Operational Aspects of Linear Lambda Calculus – Patrick Lincoln, John Mitchell - 1992
16 Linearizing Intuitionistic Implication – Patrick Lincoln, Andre Scedrov, Natarajan Shankar - 1993
280 Computational Interpretations of Linear Logic – Samson Abramsky - 1993
13 Computational Aspects of Linear Logic – Patrick D. Lincoln, D. Wakeling, C. Runciman Linearity, S. Wray, P. Petkov - 1992
15 First Order Linear Logic without Modalities Is NEXPTIME-Hard – Patrick Lincoln, Andre Scedrov - 1994
21 A logic for concurrency – Andrea Asperti - 1987
97 The Geometry of Optimal Lambda Reduction – Georges Gonthier, Martín Abadi, Jean-Jacques Lévy - 1992
53 Linear Logic Without Boxes – Georges Gonthier, Martín Abadi, Jean-Jacques Lévy - 1992
92 The linear abstract machine – Yves Lafont - 1988