Stefano Guerrini

Prof. des Universités
(Full Professor)
LIPN, USPN

Publications

  1. S. Guerrini, A. M., & Zorzi, M. (2023). Natural deduction calculi for classical and intuitionistic S5. Journal of Applied Non-Classical Logics, 33(2), 165–205. https://doi.org/10.1080/11663081.2023.2233750
  2. Guerrini, S. (2022). Optimal lambda reductions (Chapter 5). In H. Barendregt & G. Manzonetto, A Lambda Calculus Satellite, Studies in Logic (Vol. 94). College Publications.
  3. Guerrini, S., & Masini, A. (2021). Proof Nets for Classical Logic. Notre Dame Journal of Formal Logic, 62(2), 303–343. https://doi.org/10.1215/00294527-2021-0016
  4. Guerrini, S., Martini, S., & Masini, A. (2020). Quantum Turing Machines: Computations and Measurements. Applied Sciences, 10(16), 5551. https://doi.org/10.1.1/jpb001
  5. Guerrini, S., Barendrengt, H., & Piperno, A. (2017). Computing with lambda-terms: A special issue dedicated to Corrado Böhm for his 90th birthday. Mathematical Structures in Computer Science, 27(5), 557–559.
  6. Guerrini, S., & Solieri, M. (2017). Is the Optimal Implementation Inefficient? Elementarily Not. In D. Miller (Ed.), 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK (Vol. 84, pp. 17:1–17:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
  7. Guerrini, S. (2017). Linear β-reduction. In I. Cervesato & M. Fernández (Eds.), Proceedings Fourth International Workshop on Linearity, LINEARITY 2016, Porto, Portugal, 25 June 2016. (Vol. 238, pp. 44–53).
  8. Guerrini, S. (2011). A Linear Algorithm for MLL Proof Net Correctness and Sequentialization. Theor. Comput. Sci., 412(20), 1958–1978.
  9. Guerrini, S., & Masini, A. (2009). Proofs, Tests and Continuation Passing Style. ACM Trans. Comput. Logic, 10(2), 12:1–12:34.
  10. Guerrini, S., & Marzuoli, P. (2006). Commutative Locative Quantifiers for Multiplicative Linear Logic. ICALP 06.
  11. Guerrini, S. (2005). Sharing Implementations of Graph Rewriting Systems. In M. Fernandez (Ed.), Proceedings of the 2nd International Workshop on Term Graph Rewriting (TERMGRAPH 2004) (Number 5, pp. 1–196). Elsevier.
  12. Guerrini, S. (2004). Proof nets and the lambda-calculus. In T. Ehrhard, P. Ruet, J.-Y. Girard, & P. Scott (Eds.), Linear Logic in Computer Science (Vol. 316, pp. 65–118). Cambridge University Press.
  13. Guerrini, S., Martini, S., & Masini, A. (2003). Coherence for Sharing Proof Nets. Theoretical Computer Science, 294(3), 379–409.
  14. Guerrini, S., & Masini, A. (2003). Classical Logic is a Fragment of MELL.
  15. Guerrini, S., & Masini, A. (2001). Parsing MELL Proof Nets. Theoretical Computer Science, 254(1–2), 317–335.
  16. Guerrini, S., Martini, S., & Masini, A. (2001). Proof nets, Garbage, and Computations. Theoretical Computer Science, 253(2), 185–237.
  17. Di Cosmo, R., & Guerrini, S. (1999). Strong Normalization of Proof Nets Modulo Structural Congruences. In P. Narendran & M. Rusinowitch (Eds.), Rewriting Techniques and Applications, 10th International Conference, RTA-99 (Vol. 1631, pp. 75–89). Springer-Verlag.
  18. Guerrini, S. (1999). Correctness of Multiplicative Proof Nets is Linear. 14th Annual IEEE Symposium on Logic in Computer Science (LICS ’99), 454–463.
  19. Guerrini, S., Martini, S., & Masini, A. (1999). Modal Logic, Linear Logic and Optimal Lambda Reduction. In A. Cantini, E. Casari, & P. Minari (Eds.), Logic and Foundations of Mathematics. Selected Contributed Papers of the Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995 (Vol. 280, pp. 271–282). Kluwer.
  20. Guerrini, S. (1999). A General Theory of Sharing Graphs. Tcs, 227(1–2), 99–151.
  21. Asperti, A., & Guerrini, S. (1998). The Optimal Implementation of Functional Programming Languages (Vol. 45). Cambridge University Press.
  22. Guerrini, S., Masini, A., & Martini, S. (1998). An Analysis of (Linear) Exponentials Based on Extended Sequents. Logic Journal of IGPL, 6(5).
  23. Guerrini, S. (1998). Sharing-Graphs, Sharing-Morphisms and (Optimal) λ-Graph Reductions. In J. Ginzburg, Z. Khasidashvili, E. Vogel, J. J. Lévy, & Vallduvı́ E. (Eds.), The Tbilisi Symposium on Language, Logic, and Computation: Selected Papers. CSLI Publications.
  24. Guerrini, S., Martini, S., & Masini, A. (1997). Coherence for sharing proof-nets (IRCS Report 97–03; Number 97–03). Institute for Reasearch in Cognitive Science, University of Pennsylvania.
  25. Guerrini, S. (1997). A General Theory of Sharing Graphs (IRCS Report 97–04; Number 97–04). Institute for Reasearch in Cognitive Science, University of Pennsylvania.
  26. Guerrini, S., Martini, S., & Masini, A. (1997). Proof nets, Garbage, and Computations (IRCS Report 97–02; Number 97–02). Institute for Reasearch in Cognitive Science, University of Pennsylvania.
  27. Guerrini, S., Martini, S., & Masini, A. (1997). Proof nets, Garbage, and Computations. In P. De Groote (Ed.), Typed Lambda Calculi and Applications, Third International Conference on Typed Lambda Calculi and Applications, TLCA ’97 (Vol. 1210, pp. 181–195). Springer-Verlag.
  28. Guerrini, S., & Masini, A. (1996). Parsing MELL Proof Nets (IRCS Report 96–37; Number 96–37). Institute for Reasearch in Cognitive Science, University of Pennsylvania.
  29. Guerrini, S., Martini, S., & Masini, A. (1996). Coherence for Sharing Proof Nets. In H. Ganzinger (Ed.), Rewriting Techniques and Applications, 7th International Conference, RTA-96 (Vol. 1103, pp. 215–229). Springer-Verlag.
  30. Guerrini, S. (1996). Theoretical and Practical Issues of Optimal Implementations of Functional Languages [PhD Thesis]. Dipartimento di Informatica, Università di Pisa.
  31. Guerrini, S. (1994). A Linear Algebra Approach to Optimal λ-Graph Reduction (Technical Report TR-13/94; Number TR-13/94). Dipartimento di Informatica, Università di Pisa.
  32. Böhm, C., Piperno, A., & Guerrini, S. (1994). λ-definition of Functional(s) by Normal Forms. In D. Sannella (Ed.), Programming Languages and Systems – ESOP ’94, 5th European Symposium on Programming (Vol. 788, pp. 135–149). Springer-Verlag.
  33. Scopigno, R., Paoluzzi, A., Guerrini, S., & Rumolo, G. (1993). Parallel depth-merge: A paradigm for hidden surface removal. Computers and Graphics, 17(5), 583–592.
  34. Scopigno, R., Paoluzzi, A., Guerrini, S., & Rumolo, G. (1992). Parallel depth-merge: A paradigm for hidden surface removal (CNUCE Internal Report C91/10; Number C91/10). CNUCE-C.N.R.
  35. Guerrini, S. (1991). La Macchina CUCH. Implementazione di un Linguaggio di Programmazione Funzionale [Laurea in Ingegeneria Elettronica]. Facoltà di Ingegneria.