Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Parsing MELL proof nets

- S. Guerrini, A. Masini
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 6 March 2001

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 recognizing… Expand

Strong Normalization of Proof Nets Modulo Structural Congruences

- R. Cosmo, S. Guerrini
- Computer Science
- RTA
- 2 July 1999

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 an… Expand

A linear algorithm for MLL proof net correctness and sequentialization

- Stefano Guerrini
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1 April 2011

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. The… Expand

Linear Logic in Computer Science: Proof Nets and the λ-Calculus

- S. Guerrini
- Computer Science
- 2004

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 ends… Expand

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

The optimal implementation of functional programming languages

- A. Asperti, S. Guerrini
- Computer Science
- Cambridge tracts in theoretical computer science
- 1998

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. Complexity… Expand

- 76

Lambda-Definition of Function(al)s by Normal Forms

- C. Böhm, A. Piperno, S. Guerrini
- Computer Science
- ESOP
- 11 April 1994

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

An Analysis of (Linear) Exponentials Based on Extended Sequents

- S. Guerrini, S. Martini, A. Masini
- Mathematics, Computer Science
- Log. J. IGPL
- 1 September 1998

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 Linear… Expand

Coherence for Sharing Proof Nets

- S. Guerrini, S. Martini, A. Masini
- Computer Science
- RTA
- 27 July 1996

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 the… Expand