Sciweavers

TCS
2011
13 years 5 months ago
A semantic measure of the execution time in linear logic
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...
BSL
2006
81views more  BSL 2006»
13 years 10 months ago
Classifying the Provably Total Functions of PA
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...
Andreas Weiermann
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 10 months ago
Topological Observations on Multiplicative Additive Linear Logic
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a "topological" game for Multiplicative Additive Linear Logic ...
André Hirschowitz, Michel Hirschowitz, Tom ...
AIML
2006
13 years 11 months ago
Deep Sequent Systems for Modal Logic
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
Kai Brünnler
TYPES
1998
Springer
14 years 2 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner
ICFP
2000
ACM
14 years 2 months ago
The duality of computation
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
Pierre-Louis Curien, Hugo Herbelin
CSL
2001
Springer
14 years 2 months ago
Non-commutativity and MELL in the Calculus of Structures
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...
Alessio Guglielmi, Lutz Straßburger
CSL
2003
Springer
14 years 3 months ago
Atomic Cut Elimination for classical Logic
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
Kai Brünnler
PADL
2004
Springer
14 years 3 months ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi
TLCA
2005
Springer
14 years 3 months ago
Semantic Cut Elimination in the Intuitionistic Sequent Calculus
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
Olivier Hermant