On intuitionistic proof transformations, their complexity, and application to constructive program synthesis

• Autorzy: Egly U. , Schmitt S.
• Języki publikacji: EN

Abstrakty

EN

We present a translation of intuitionistic sequent proofs from a multi-succedent calculus LJmc into a single-succedent calculus LJ. The former gives a basis for automated proof search whereas the latter is better suited for proof presentation and program construction from proofs in a system for constructive program synthesis. Well-known translations from the literature have a severe drawback; they use cuts in order to establish the transformation with the undesired consequence that the resulting program term is not intuitive. We establish a transformation based on permutation of inferences and discuss the relevant properties with respect to proof complexity and program terms. As an important result we show that LJ cannot polynomially simulate LJmc (both without the cut rule), even in the propositional fragment.

Słowa kluczowe

EN

proof transformations; complexity; sequent calculus; program synthesis

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 1999
• Tom: Vol. 39, Nr 1,2
• Strony: 59--83
• Opis fizyczny: bibliogr. 17 poz.

Twórcy

autor

Egly U.

autor

Schmitt S.

• Wissenbasierte Systeme 184/3, TU Wien, Treitlstr. 3, A-1040 Wien, Austria,