Articoli

Riviste

• G. Curzi and L. Roversi (TCS 2020) : A type-assignment of linear erasure and duplication

Conferenze internazionali e workshop

• G.Curzi and M. Pagani (LICS 2020) : The Benefit of Being Non-Lazy in Probabilistic λ-calculus
  
  
• G. Curzi (TLLA 2020) : Linear additives (Extended Abstract)

Articoli sottomessi

• G. Curzi and L. Roversi : Probabilistic Soft Type Assignment (sottomesso a CSL 2021)

---

Tesi di dottorato

• Non-Laziness in Implicit Computational Complexity and Probabilistic λ-calculus
  
  
• Slides della difesa finale

---

Presentazioni

Conferenze internazionali e workshop

• The Benefit of Being Non-Lazy in Probabilistic λ-calculus (slides). LICS, Saarbrücken (Germania), 2020.
  
  
• Linear Additives (slides). TLLA, Paris-Aubervilliers (Francia), 2020.
  
  
• Toward a semantic characterization of probabilistic complexity classes (slides). PIHOC, Bologna (Italia), 2018.

Seminari

• La complessità computazionale e il problema P vs NP (slides). Cycle of Seminars, Urbino (Italia), 2017.
  
  
• Che cos’è l’isomorfismo di Curry-Howard (slides). Cycle of Seminars, Urbino (Italia), 2016.