A functional correspondence between natural deduction and the sequent calculus

Since works of Andreoli [2], we know that full linear logic may be used as a logical programming language thanks to focalization and works have been done on lazy evaluation in this

reasonable form of analyticity that can be demanded in Gilp ∗ : for any deriva- tion d, containing both cuts at the sequent and the TND-sequent level, there exists a cut-

We can expect (and it is indeed the case) that the combi- natorics of these objects is not easy to describe. In particular, a representation which is adapted to computer

The paper is organised as follows: Section 2 introduces the focused sequent calculus with polarities, Section 3 reviews the basic DPLL(T ) procedure [NOT05, BNOT06], Section 4

– Plugins can be programmed to drive the kernel, using its API, through the search space towards an answer provable or not provable; soundness of the answer only relies on the

The sequent calculus LK (T ) manipulates the formulae of first-order logic, with the specificity that every predicate symbol is classified as either positive or negative, and

We have illustrated that, instead of discarding the sequent calculus in search of canonical proof systems, sequent proofs can be systematically abstracted by (maximal)

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des