Skip to main content
SpringerLink
Log in

Intuitionistic proof transformations and their application to constructive program synthesis

  • Conference paper
  • First Online:
Artificial Intelligence and Symbolic Computation (AISC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1476))

Abstract

We present a translation of intuitionistic sequent proofs from a multi-succedent calculus LTmc into a single-succedent calculus LT. 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.

The research report is supported by the German Academic Exchange Service DAAD with a fellowship to the second author.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. L. Bates and R. L. Constable. Proofs as programs. ACM Transactions on Programming Languages and Systems, 7(1):113–136, January 1985.

    Article  MATH  Google Scholar 

  2. W. Bibel, D. Korn, C. Kreitz, F. Kurucz, J. Otten, S. Schmitt, and G. Stolpmann. A Multi-Level Approach to Program Synthesis. In 7 th LoPSTr Workshop, LNCS, 1998.

    Google Scholar 

  3. R. L. Constable, S. F. Allen, and H. M. Bromley. Implementing Mathematics with the NuPRL proof development system. Prentice Hall, 1986.

    Google Scholar 

  4. H. B. Curry. Foundations of Mathematical Logic. Dover, Dover edition, 1977.

    Google Scholar 

  5. E. Eder. Relative Complexities of First Order Calculi. Vieweg, 1992.

    Google Scholar 

  6. G. Gentzen. Untersuchungen über das logische Schlie\en. Mathematische Zeitschrift, 39:176–210, 405–431, 1935.

    Article  MathSciNet  Google Scholar 

  7. S. C. Kleene. Permutability of Inferences in Gentzen’s Calculi LK and LJ. Memoirs of the AMS, 10:1–26, 1952.

    MATH  MathSciNet  Google Scholar 

  8. S. Maehara. Eine Darstellung der intuitionistischen Logik in der klassischen. Nagoya Mathematical Journal, 7:45–64, 1954.

    MATH  MathSciNet  Google Scholar 

  9. P. Martin-Löf. Intuitionistic Type Theory, volume 1 of Studies in Proof Theory Lecture Notes. Bibliopolis, Napoli, 1984.

    Google Scholar 

  10. J. Otten and C. Kreitz. A Uniform Proof Procedure for Classical and Non-classical Logics. In 20thGerman Annual Conference on AI, LNAI 1137, pp. 307–319, 1996.

    MathSciNet  Google Scholar 

  11. S. Schmitt and C. Kreitz. On transforming intuitionistic matrix proofs into standard-sequent proofs. In 4thTABLEAUX Workshop, LNAI 918, pp. 106–121, 1995.

    MathSciNet  Google Scholar 

  12. S. Schmitt and C. Kreitz. Converting non-classical matrix proofs into sequent-style systems. In CADE-13, LNAI 1104, pp. 418–432, 1996.

    Google Scholar 

  13. T. Tammet. A Resolution Theorem Prover for Intuitionistic Logic. In CADE-13, LNAI 1104, pp. 2–16, 1996.

    Google Scholar 

  14. A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge Univ. Press, 1996.

    Google Scholar 

  15. L. Wallen. Automated deduction in nonclassical logics. MIT Press, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abt. Wissensbasierte Systeme 184/3, TU Wien, Treitlstr. 3, A-1040, Wien

    Uwe Egly

  2. Department of Computer Science, Cornell University, Ithaca, NY

    Stephan Schmitt

Authors
  1. Uwe Egly
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephan Schmitt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet Jan Plaza

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Egly, U., Schmitt, S. (1998). Intuitionistic proof transformations and their application to constructive program synthesis. In: Calmet, J., Plaza, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 1998. Lecture Notes in Computer Science, vol 1476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055908

Download citation

  • DOI: https://doi.org/10.1007/BFb0055908

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64960-1

  • Online ISBN: 978-3-540-49816-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation