Arias, J., Desainte-Catherine, M., Olarte, C. and Rueda, C. (2015). Foundations for reliable and flexible interactive multimedia scores. In: Collins, T., Meredith, D. and Volk, A. (eds.) MCM 2015, Lecture Notes in Computer Science, vol. 9110, Springer, 29–41.

Andreoli, J.-M. (1992). Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2 (3) 297–347.

Baelde, D. (2012). Least and greatest fixed points in linear logic. ACM Transactions on Computational Logic 13 (1) 2.

Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L. and Hwang, L.J. (1992). Symbolic model checking: 10^{∧}20 states and beyond. Information and Computation 98 (2) 142–170.

Clarke, E.M. and Emerson, E.A. (1981). Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logics of Programs, Workshop, Yorktown Heights, May 1981, Lecture Notes in Computer Science, vol. 131, New York: Springer, 52–71.

Chaudhuri, K. (2010). Classical and intuitionistic subexponential logics are equally expressive. In: Dawar, A. and Veith, H. (eds.) CSL 2010, Lecture Notes in Computer Science, vol. 6247, Springer, 185–199.

Church, A. (1940). A formulation of the simple theory of types. The Jornal of Symbolic Logic 5 56–68.

Cervesato, I. and Pfenning, F. (2002). A linear logical framework. Information and Computation 179 (1) 19–75.

Caires, L., Pfenning, F. and Toninho, B. (2016). Linear logic propositions as session types. Mathematical Structures in Computer Science 26 (3) 367–423.

Chaudhuri, K. and Reis, G. (2015). An adequate compositional encoding of bigraph structure in linear logic with subexponentials. In: Davis, M., Fehnker, A., McIver, A. and Voronkov, A. (eds.) LPAR-20 2015, Lecture Notes in Computer Science, vol. 9450, Springer, 146–161.

Despeyroux, J. and Chaudhuri, K. (2014). A hybrid linear logic for constrained transition systems. In: Post-Proc. of TYPES 2013, Leibniz Intl. Proceedings in Informatics, vol. 26, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 150–168.

Danos, V., Joinet, J.-B. and Schellinx, H. (1993). The structure of exponentials: Uncovering the dynamics of linear logic proofs. In: Gottlob, G., Leitsch, A. and Mundici, D. (eds.) Kurt Gödel Colloquium, Lecture Notes in Computer Science, vol. 713, Springer, 159–171.

de Maria, E., Despeyroux, J. and Felty, A. (2014). A logical framework for systems biology. In: *Proceedings of the 1st Intl. Conference on Formal Methods in Macro-Biology (FMMB)*, Lecture Notes in Computer Science, vol. 8738, Springer, 136–155.

Despeyroux, J., Olarte, C. and Pimentel, E. (2017). Hybrid and subexponential linear logics. Electronic Notes in Theoretical Computer Science 332 95–111.

Girard, J.-Y. (1987). Linear logic. Theoretical Computer Science 50 1–102.

Miller, D. (1992). Unification under a mixed prefix. Journal of Symbolic Computation 14 (4) 321–358.

Miller, D. and Pimentel, E. (2013). A formal framework for specifying sequent calculus proof systems. Theoretical Computer Science 474 98–116.

Nigam, V. (2014). A framework for linear authorization logics. Theoretical Computer Science 536 21–41.

Nigam, V. and Miller, D. (2009). Algorithmic specifications in linear logic with subexponentials. In: Porto, A. and López-Fraguas, F.J. (eds.) PPDP, ACM, 129–140.

Nigam, V. and Miller, D. (2010). A framework for proof systems. Journal of Automated Reasoning 45 (2) 157–188.

Nigam, V., Olarte, C. and Pimentel, E. (2013). A general proof system for modalities in concurrent constraint programing. In: CONCUR, Lecture Notes in Computer Science, vol. 8052, Springer Verlag, 410–424.

Nigam, V., Olarte, C. and Pimentel, E. (2017). On subexponentials, focusing and modalities in concurrent systems. Theoretical Computer Science 693 35–58.

Nigam, V., Pimentel, E. and Reis, G. (2011). Specifying proof systems in linear logic with subexponentials. Electronic Notes in Theoretical Computer Science 269 109–123.

Nigam, V., Pimentel, E. and Reis, G. (2016). An extended framework for specifying and reasoning about proof systems. Journal of Logic and Computation 26 (2) 539–576.

Olarte, C., Chiarugi, D., Falaschi, M. and Hermith, D. (2016). A proof theoretic view of spatial and temporal dependencies in biochemical systems. Theoretical Computer Science 641 25–42.

Olarte, C., Pimentel, E. and Nigam, V. (2015). Subexponential concurrent constraint programming. Theoretical Computer Science 606 98–120.

Olarte, C., Pimentel, E. and Rueda, C. (2018). A concurrent constraint programming interpretation of access permissions. TPLP 18 (2) 252–295.

Pimentel, E., Olarte, C. and Nigam, V. (2014). A proof theoretic study of soft concurrent constraint programming. Theory and Practice of Logic Programming 14 475–308.

Reed, J. (2006). Hybridizing a logical framework. In: International Workshop on Hybrid Logic (HyLo), Electronic Notes in Theoretical Computer Science, Seattle, USA, Elsevier, 135–148.