877 search results - page 4 / 176 » Structural Cut Elimination |
TLCA
2005
Springer
14 years 28 days ago
2005
Springer
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 ...
CSL
2004
Springer
14 years 25 days ago
2004
Springer
The aim of this work is to give an alternative presentation for the multiplicative fragment of Yetter’s cyclic linear logic. The new presentation is inspired by the calculus of s...
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...