News

XML Feed

Upcoming

Past

• 04 September 2017
  

  The paper “Is the optimal implementation inefficient? Elementarily not” will be presented at the Second International Conference on Formal Structures for Computation and Deduction (FSCD 2017), which will be held at Oxford, on September 4–9, 2017.

• 21 July 2017
  

  The short report on atomic graphs I authored with David has been accepted at the 4th International Workshop on Structures and Deduction.

• 26 June 2017
  

  A short report about my ongoing work with David Sherratt on atomic graphs has been submitted. Have a look at my research page.

• 14 June 2017
  

  The paper about the efficiency of the optimal reduction of lambda-terms typed in light and elementary linear logic has been accepted at the Second International Conference on Formal Structures for Computation and Deduction (FSCD 2017).

• 25 May 2017
  

  Website updated: adaptive layout and more information about past teaching activities. Dropped Italian translations.

• 22 April 2017
  

  Results about the complexity of the optimal implementation have been finally submitted. More on the research page.

• 21 February 2017
  

  Talk surveying my doctoral investigations and sketching direction of my current or prospective interest. At 01:15PM in 1W.2.102, University of Bath.

• 21 February 2017
  

  Joined the group Mathematical foundations of computation in the Computer science department of the University of Bath, as a research associate of Jim Laird.

• 07 December 2016
  

  My first child Geremia is born!

• 30 November 2016
  

  Viva at LIPN. Referees: Laurent Regnier (Aix-Marseille Université), Patrick Baillot (ENS Lyon). Jury members: Ian Mackie (LIX, École Polytechnique), Damiano Mazza (LIPN, Paris 13).

• 11 October 2016
  

  Doctoral thesis submitted for revision.

• 07 October 2016
  

  Talk about the efficiency of optimal implementation of light logics at the meeting of the Elica projectheld at the DISI, in Bologna. I briefly showed the quadratic worst-case bound and sketched the syntactical approach of the proof.

• 14 September 2016
  

  Fixed the last technical details in the manuscript about the complexity of optimal implementation of light logics.

• 19 August 2016
  

  The manuscript about the geometry of resource interaction and the Taylor-Ehrhard-Regnier expansion will appear in Mathematical Structures in Computer Science.

• 18 May 2016
  

  Improvements and clarifications applied to the manuscript about the geometry of resource interaction and the Taylor-Ehrhard-Regnier expansion. Once again, thanks to anonymous referees of Mathematical Structures in Computer Science.

• 20 March 2016
  

  The manuscript about the complexity of optimal implementation of light logics, under a drafting stage since quite a long time, still need major reworkings to make it readable.

• ... Older news.