• Publications
  • Influence
A formal framework for specifying sequent calculus proof systems
TLDR
In this paper we show how to use classical linear logic as a logical framework to specify sequent calculus proof systems and to establish some simple consequences of the specified sequent calculi. Expand
  • 38
  • 3
  • PDF
Using Linear Logic to Reason about Sequent Systems
TLDR
Linear logic can be used as a meta-logic for the specification of some sequent calculus proof systems. Expand
  • 27
  • 3
  • PDF
A General Proof System for Modalities in Concurrent Constraint Programming
TLDR
We propose the proof system SELL$^\Cap$, which extends linear logic with subexponentials with quantifiers over subexponsentials, therefore allowing for the specification of concurrent systems with timed, spatial, and epistemic modalities. Expand
  • 26
  • 2
Modularisation of Sequent Calculi for Normal and Non-normal Modalities
TLDR
In this work, we explore the connections between (linear) nested sequent calculi and ordinary sequENT calculi for normal and non-normal modal logics. Expand
  • 19
  • 2
  • PDF
Lazy Strong Normalization
TLDR
This paper presents a logical characterization of lazy strongly @b-normalizing terms using intersection types. Expand
  • 10
  • 2
  • PDF
Proof Search in Nested Sequent Calculi
TLDR
We propose a notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the corresponding sequENT calculi. Expand
  • 22
  • 1
  • PDF
Subexponential concurrent constraint programming
TLDR
In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities. Expand
  • 17
  • 1
  • PDF
A Semantical View of Proof Systems
TLDR
We show a semantical characterisation of intuitionistic, normal and non-normal modal logics for all these systems, via a case-by-case translation between labelled nested to labelled sequent systems. Expand
  • 7
  • 1
  • PDF
Strong normalization from an unusual point of view
A new complete characterization of ?-strong normalization is given, both in the classical and in the lazy ?-calculus, through the notion of potential valuability inside two suitable parametricExpand
  • 4
  • 1
  • PDF
Sequentialising Nested Systems
TLDR
We identify general conditions under which a nested calculus can be transformed into a sequent calculus by restructuring the nested sequent derivation (proof) and shedding extraneous information to obtain a derivation of the same formula. Expand
  • 3
  • 1
  • PDF
...
1
2
3
4
5
...