Carlos Miguel Soto defends his licenciatura thesis (eq M2) in Computer Science at Universidad de Buenos Aires.
Date: Tuesday, 6 May 2025
Time: 11:00 AM
Location: Pabellón 0+INF, Room to be confirmed
Thesis advisor: Alejandro Díaz-Caro (Centre Inria de l’Université de Lorraine & Universidad Nacional de Quilmes)
Jury members:
- Pablo Barenbaum (Universidad de Buenos Aires)
- Octavio Malherbe (Universidad de la República)
- Benoît Valiron (Université Paris-Saclay)
Title: On the Completeness of a Syntactically Linear Logic
Abstract: The LS calculus, an extension of the proof language of linear logic related to quantum computing, was given a concrete semantics in [DCM23]. In this thesis, we prove completeness results for this semantics with respect to computational equivalence. We introduce an operational semantics for LS and show its isomorphism with the categorical semantics under certain conditions. Moreover, we show that the category can be restricted to finitely generated semimodules, which possess better properties.