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

G. Bellin and A. Fleury, Planar and braided proof-nets for multiplicative linear logic with mix, Archive for Mathematical Logic, vol.37, issue.5-6, pp.309-325, 1998.
DOI : 10.1007/s001530050101

G. Bellin and P. Scott, On the ??-calculus and linear logic, Theoretical Computer Science, vol.135, issue.1, pp.11-65, 1994.
DOI : 10.1016/0304-3975(94)00104-9

T. Braibant and D. Pous, Coq library: ATBR, algebraic tools for binary relations, 2009.

T. Braibant and D. Pous, An Efficient Coq Tactic for Deciding Kleene Algebras, Proc. ITP, 2010.
DOI : 10.1007/978-3-642-14052-5_13

P. Burmeister, Algebras and Orders, chapter Partial Algebra, 1993.

R. Diaconescu, An encoding of partial algebras as total algebras, Information Processing Letters, vol.109, issue.23-24, pp.23-241245, 2009.
DOI : 10.1016/j.ipl.2009.09.008

N. Dojer, Applying term rewriting to partial algebra theory, Fundamenta Informaticae, vol.63, issue.4, pp.375-384, 2004.

H. Doornbos, R. Backhouse, and J. Van-der-woude, A calculational approach to mathematical induction, Theoretical Computer Science, vol.179, issue.1-2, pp.103-135, 1997.
DOI : 10.1016/S0304-3975(96)00154-5

P. Freyd and A. Scedrov, Categories, Allegories, 1990.

N. Galatos, P. Jipsen, T. Kowalski, and H. Ono, Residuated lattices: an algebraic glimpse at substructural logics, Stud. in Log. and Found. of Math, vol.151, p.532, 2007.

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

B. Grégoire and A. Mahboubi, Proving Equalities in a Commutative Ring Done Right in Coq, Proc. TPHOLs, pp.98-113, 2005.
DOI : 10.1007/11541868_7

J. Harrison, A HOL decision procedure for elementary real algebra, HUG, pp.426-435, 1993.
DOI : 10.1007/3-540-57826-9_153

P. Jipsen, From Semirings to Residuated Kleene Lattices, Studia Logica, vol.76, issue.2, pp.291-303, 2004.
DOI : 10.1023/B:STUD.0000032089.54776.63

P. Jipsen and C. Tsinakis, A Survey of Residuated Lattices, Ord. Alg. Struct, 2002.
DOI : 10.1007/978-1-4757-3627-4_3

M. Kanovich, The complexity of neutrals in linear logic, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, pp.486-495, 1995.
DOI : 10.1109/LICS.1995.523282

S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies, pp.3-41, 1956.
DOI : 10.1515/9781400882618-002

D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.366-390, 1994.
DOI : 10.1109/LICS.1991.151646

D. Kozen, Kleene algebra with tests, ACM Transactions on Programming Languages and Systems, vol.19, issue.3, pp.427-443, 1997.
DOI : 10.1145/256167.256195

D. Kozen, Typed Kleene algebra, 1998.

D. Krob, A complete system of B-rational identities, TCS, vol.89, issue.2, pp.207-343, 1991.
DOI : 10.1007/BFb0032022
URL : https://hal.archives-ouvertes.fr/hal-00017725

J. Lambek, The Mathematics of Sentence Structure, The American Mathematical Monthly, vol.65, issue.3, pp.154-170, 1958.
DOI : 10.2307/2310058

T. Mossakowski, Relating CASL with other specification languages: the institution level, Theoretical Computer Science, vol.286, issue.2, pp.367-475, 2002.
DOI : 10.1016/S0304-3975(01)00369-3

M. Norrish, Complete Integer Decision Procedures as Derived Rules in HOL, Proc. TPHOLs, pp.71-86, 2003.
DOI : 10.1007/10930755_5

M. Okada and K. Terui, Abstract, The Journal of Symbolic Logic, vol.62, issue.02, pp.790-802, 1999.
DOI : 10.1007/BF01053025

H. Ono and Y. Komori, Logics without the contraction rule, The Journal of Symbolic Logic, vol.28, issue.01, pp.169-201, 1985.
DOI : 10.1090/pspum/025/0363802

M. Pentus, Lambek calculus is NP-complete, Theoretical Computer Science, vol.357, issue.1-3, pp.186-201, 2006.
DOI : 10.1016/j.tcs.2006.03.018

D. Pous, Web appendix of this paper

V. R. Pratt, Action logic and pure induction, Proc. JELIA, pp.97-120, 1990.
DOI : 10.1007/BFb0018436

L. Regnier, Lambda-calcul et réseaux, Thèse de doctorat, 1992.

A. Wille, A Gentzen system for involutive residuated lattices, Algebra universalis, vol.54, issue.4, pp.449-463, 2005.
DOI : 10.1007/s00012-005-1957-6

D. Yetter, Quantales and (noncommutative) linear logic, The Journal of Symbolic Logic, vol.II, issue.01, pp.41-64, 1990.
DOI : 10.1017/S0305004100065403