Proof Diagrams for Multiplicative Linear Logic: Syntax and Semantics

  • Matteo AcclavioEmail author


Proof nets are a syntax for linear logic proofs which gives a coarser notion of proof equivalence with respect to syntactic equality together with an intuitive geometrical representation of proofs. In this paper we give an alternative 2-dimensional syntax for multiplicative linear logic derivations. The syntax of string diagrams authorizes the definition of a framework where the sequentializability of a term, i.e.  deciding whether the term corresponds to a correct derivation, can be verified in linear time. Furthermore, we can use this syntax to define a denotational semantics for multiplicative linear logic with units by means of equivalence classes of proof diagrams modulo a terminating rewriting.


String diagrams Liner logic Proof semantics Monoidal categories 

Mathematics Subject Classification

18D10 03b47 18C50 03B70 



I would like to thank Michele Alberti, Marianna Girlando, Giulio Guerrieri, Paolo Pistone and Lionel Vaux for the fruitful exchanges during the redaction of this work. A special acknowledgment to Yves Guiraud who wrote (and upgraded for the scope) the latex package for string diagrams representations [14] employed in the present manuscript. Thank to reviewers for carefull readings, useful remark and constructive observations.


  1. 1.
    Abrusci, V.M.: Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic. J. Symb. Logic 56(04), 1403–1451 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Acclavio, M. : A complete proof of coherence for symmetric monoidal categories using rewriting. arXiv:1606.01722 (2016)
  3. 3.
    Acclavio, M.: Proof diagrams for multiplicative linear logic. arXiv:1606.09016 (2016)
  4. 4.
    John B.C., Lauda A.: A prehistory of n-categorical physics, pp. 13–128. Cambridge University Press, Cambridge (2011)Google Scholar
  5. 5.
    Burroni, A.: Higher-dimensional word problems with applications to equational logic. Theor. Comput. Sci. 115(1), 43–62 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Danos, V., Regnier, L.: The structure of multiplicatives. Arch. Math. Logic 28(3), 181–203 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    De Falco, L.T.: Réseaux, cohérence et expériences obsessionnelles. Ph.D. thesis (2000)Google Scholar
  8. 8.
    Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50(1), 1–101 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Girard, J.-Y.: A new constructive logic: classic logic. Math. Struct. Comput. Sci. 1(03), 255–296 (1991)CrossRefzbMATHGoogle Scholar
  10. 10.
    Girard, J.-Y.: Linear logic: its syntax and semantics. London Mathematical Society Lecture Note Series, pp. 1–42 (1995)Google Scholar
  11. 11.
    Girard, J.-Y.: Proof-nets: the parallel syntax for proof-theory. Lecture Notes, Pure and Applied Mathematics, pp. 97–124 (1996)Google Scholar
  12. 12.
    Guerrini, S., Masini, A.: Parsing MELL proof nets. Theor. Comput. Sci. 254(1), 317–335 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Guiraud, Y.: Termination orders for three-dimensional rewriting. J. Pure Appl. Algebra 207(2), 341–371 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Guiraud, Y: Catex Latex patch. (2007)
  15. 15.
    Guiraud, Y., Malbos, P.: Higher-dimensional categories with finite derivation type. Theory Appl. Categ. 22(18), 420–478 (2009)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Heijltjes, W., Houston, R.: No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete. In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), p. 50. ACM, New York City (2014)Google Scholar
  17. 17.
    Jimbo, M.: Introduction to the Yang–Baxter equation. Int. J. Mod. Phys. A 4(15), 3759–3777 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Joyal, André, Street, Ross: The geometry of tensor calculus I. Adv. Math. 88(1), 55–112 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Lafont, Y: From proof nets to interaction nets. London Mathematical Society Lecture Note Series, pp. 225–248 (1995)Google Scholar
  20. 20.
    Lafont, Y.: Towards an algebraic theory of Boolean circuits. J. Pure Appl. Algebra 184(2), 257–310 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Mac Lane, S.: Categories for the Working Mathematician, vol. 5. Springer, Berlin (2013)zbMATHGoogle Scholar
  22. 22.
    Mellies, P.-A.: Categorical semantics of linear logic. Interact. Models Comput. Program Behav. 27, 15–215 (2009)MathSciNetzbMATHGoogle Scholar
  23. 23.
    Selinger, P.: A survey of graphical languages for monoidal categories. In: Coecke B. (ed.) New structures for physics. Lecture notes in Physics, vol 813, pp. 289–355. Springer, Berlin (2010)Google Scholar
  24. 24.
    Straßburger, L., Lamarche, F.: On proof nets for multiplicative linear logic with units. In: International Workshop on Computer Science Logic, pp. 145–159. Springer, Berlin (2004)Google Scholar
  25. 25.
    Street, R.: Limits indexed by category-valued 2-functors. J. Pure Appl. Algebra 8(2), 149–181 (1976)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media B.V., part of Springer Nature 2018

Authors and Affiliations

  1. 1.Inria SaclayFrance
  2. 2.LIX, Ecole PolytechniquePalaiseauFrance

Personalised recommendations