J. Andreoli, Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation, vol.2, issue.3, pp.297-347, 1992.
DOI : 10.1093/logcom/2.3.297

K. Chaudhuri, Classical and Intuitionistic Subexponential Logics Are Equally Expressive, Computer Science Logic Lecture Notes in Computer Science, vol.6247, pp.185-199, 2010.
DOI : 10.1007/978-3-642-15205-4_17
URL : https://hal.archives-ouvertes.fr/inria-00534865

K. Chaudhuri, Undecidability of Multiplicative Subexponential Logic, Proceedings LINEARITY 2014, pp.1-6, 2014.
DOI : 10.4204/EPTCS.176.1
URL : https://hal.archives-ouvertes.fr/hal-00998753

K. Chaudhuri, F. Pfenning, and G. Price, A Logical Characterization of Forward and Backward Chaining in the Inverse Method, Journal of Automated Reasoning, vol.2, issue.5, pp.133-177, 2008.
DOI : 10.1007/s10817-007-9091-0

C. Liang and D. Miller, Focusing and polarization in linear, intuitionistic, and classical logics, Theoretical Computer Science, vol.410, issue.46, pp.4747-4768, 2009.
DOI : 10.1016/j.tcs.2009.07.041

P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar, Decision problems for propositional linear logic, Annals of Pure and Applied Logic, vol.56, issue.1-3, pp.239-311, 1992.
DOI : 10.1016/0168-0072(92)90075-B

P. López, F. Pfenning, J. Polakow, and K. Watkins, Monadic concurrent linear logic programming, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '05, pp.35-46, 2005.
DOI : 10.1145/1069774.1069778

D. Miller and A. Saurin, From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic, CSL 2007: Computer Science Logic, pp.405-419, 2007.
DOI : 10.1007/978-3-540-74915-8_31
URL : https://hal.archives-ouvertes.fr/hal-00527888

M. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines, The Annals of Mathematics, vol.74, issue.3, pp.437-455, 1961.
DOI : 10.2307/1970290

V. Nigam, Exploiting non-canonicity in the sequent calculus, 2009.
URL : https://hal.archives-ouvertes.fr/pastel-00005487

V. Nigam and D. Miller, Algorithmic specifications in linear logic with subexponentials, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09, pp.129-140, 2009.
DOI : 10.1145/1599410.1599427

V. Nigam, C. Olarte, and E. Pimentel, A General Proof System for Modalities in Concurrent Constraint Programming, 24th International Conference on Concurrency Theory (CONCUR), pp.410-424, 2013.
DOI : 10.1007/978-3-642-40184-8_29

V. Nigam, E. Pimentel, and G. Reis, Specifying Proof Systems in Linear Logic with Subexponentials, Electronic Notes in Theoretical Computer Science, vol.269, pp.109-123, 2011.
DOI : 10.1016/j.entcs.2011.03.009

V. Nigam, E. Pimentel, and G. Reis, An extended framework for specifying and reasoning about proof systems, Journal of Logic and Computation, vol.26, issue.2, 2014.
DOI : 10.1093/logcom/exu029

R. J. Simmons, Structural Focalization, ACM Transactions on Computational Logic, vol.15, issue.3, p.21, 2014.
DOI : 10.1145/2629678

K. Watkins, I. Cervesato, F. Pfenning, and D. Walker, A concurrent logical framework I: Judgments and properties, 2003.