• Publications
  • Influence
Parsing MELL proof nets
We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizingExpand
  • 18
  • 2
Strong Normalization of Proof Nets Modulo Structural Congruences
This paper proposes a notion of reduction for the proof nets of Linear Logic modulo an equivalence relation on the contraction links, that essentially amounts to consider the contraction as anExpand
  • 17
  • 2
A linear algorithm for MLL proof net correctness and sequentialization
The paper presents in full detail the first linear algorithm given in the literature (Guerrini (1999) 6) implementing proof structure correctness for multiplicative linear logic without units. TheExpand
  • 19
  • 1
Linear Logic in Computer Science: Proof Nets and the λ-Calculus
In this survey we shall present the main results on proof nets for the Multiplicative and Exponential fragment of Linear Logic (MELL) and discuss their connections with λ-calculus. The survey endsExpand
  • 4
  • 1
Correctness of multiplicative proof nets is linear
  • S. Guerrini
  • Mathematics, Computer Science
  • Proceedings. 14th Symposium on Logic in Computer…
  • 2 July 1999
We reformulate Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linear algorithm.Expand
  • 53
The optimal implementation of functional programming languages
1. Introduction 2. Optimal reduction 3. The full algorithm 4. Optimal reductions and linear logic 5. Zig-zag 6. Paths 7. Read-back 8. Other translations in sharing graphs 9. Safe nodes 10. ComplexityExpand
  • 76
Lambda-Definition of Function(al)s by Normal Forms
Lambda-calculus is extended in order to represent a rather large class of recursive equation systems, implicitly characterizing function(al)s or mappings of some algebraic domain into arbitrary sets.Expand
  • 17
Jumping Boxes
  • 14
An Analysis of (Linear) Exponentials Based on Extended Sequents
We apply the sequents approach to the analysis of several logics derived from linear logic In particular we present a uniform formal system for Linear Logic Elementary Linear Logic and Light LinearExpand
  • 14
Coherence for Sharing Proof Nets
Sharing graphs are a way of representing linear logic proof-nets in such a way that their reduction never duplicates a redex. In their usual presentations, they present a problem of coherence: if theExpand
  • 12