3690 search results - page 9 / 738 » Computation with classical sequents |
PPDP
2004
Springer
14 years 3 months ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses globa...
CADE
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
CADE
1997
Springer
14 years 1 months ago
1997
Springer
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic. On this basis we develop a matrix-based proof search procedure for this fra...
EUROPAR
1997
Springer
14 years 1 months ago
1997
Springer
We experiment with sequential and parallel versions of the Karatsuba multiplication algorithm implemented under the paclib computer algebra system on a Sequent Symmetry shared-memo...