N. D. Belnap, Display logic, Journal of Philosophical Logic, vol.11, issue.4, pp.375-417, 1982.
DOI : 10.1007/BF00284976

G. M. Bierman, A note on full intuitionistic linear logic, Annals of Pure and Applied Logic, vol.79, issue.3, pp.281-287, 1996.
DOI : 10.1016/0168-0072(96)00004-8
URL : http://doi.org/10.1016/0168-0072(96)00004-8

T. Bräuner and V. De-paiva, A formulation of linear logic based on dependencyrelations, CSL, pp.129-148, 1997.

K. Brünnler, Deep sequent systems for modal logic, Archive for Mathematical Logic, vol.85, issue.2, pp.551-577, 2009.
DOI : 10.1007/s00153-009-0137-3

R. Clouston, J. E. Dawson, R. Goré, and A. Tiu, Annotation-free sequent calculi for full intuitionistic linear logic, CSL, pp.197-214, 2013.

R. Clouston, J. E. Dawson, R. Goré, and A. Tiu, Annotation-free sequent calculi for full intuitionistic linear logic -extended version, 2013.

J. E. Dawson and R. Goré, Formalised Cut Admissibility for Display Logic, TPHOLs, pp.131-147, 2002.
DOI : 10.1007/3-540-45685-6_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7985

J. E. Dawson and R. Goré, Generic Methods for Formalising Sequent Calculi Applied to Provability Logic, LPAR, pp.263-277, 2010.
DOI : 10.1007/978-3-642-16242-8_19

R. Goré, Substructural logics on display, Logic Journal of IGPL, vol.6, issue.3, pp.451-504, 1998.
DOI : 10.1093/jigpal/6.3.451

R. Goré, L. Postniece, and A. Tiu, Cut-elimination and proof search for biintuitionistic tense logic, AiML, pp.156-177, 2010.

R. Goré, L. Postniece, and A. Tiu, On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics, Logical Methods in Computer Science, vol.7, issue.2, 2011.
DOI : 10.2168/LMCS-7(2:8)2011

M. Hyland and V. De-paiva, Full intuitionistic linear logic (extended abstract)

R. Kashima, Cut-free sequent calculi for some tense logics, Studia Logica, vol.13, issue.1, pp.119-135, 1994.
DOI : 10.1007/BF01053026

J. Park, J. Seo, and S. Park, A theorem prover for boolean BI, POPL, pp.219-232, 2013.

F. Poggiolesi, The Method of Tree-Hypersequents for??Modal??Propositional??Logic, Trends in Logic IV, pp.31-51, 2009.
DOI : 10.1007/978-1-4020-9084-4_3
URL : https://hal.archives-ouvertes.fr/halshs-00775815

H. Schellinx, Some Syntactical Observations on Linear Logic, Journal of Logic and Computation, vol.1, issue.4, pp.537-559, 1991.
DOI : 10.1093/logcom/1.4.537

L. Straßburger, Cut Elimination in Nested Sequents for Intuitionistic Modal Logics, FoSSaCS, pp.209-224, 2013.
DOI : 10.1007/978-3-642-37075-5_14

D. Traytel, A. Popescu, and J. C. Blanchette, Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.596-605, 2012.
DOI : 10.1109/LICS.2012.75

C. Urban, Nominal Techniques in Isabelle/HOL, Journal of Automated Reasoning, vol.323, issue.1???2, pp.327-356, 2008.
DOI : 10.1007/s10817-008-9097-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.9675