Advertisement

The greatest common divisor: A case study for program extraction from classical proofs

  • U. Berger
  • H. Schwichtenberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1158)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ulrich Berger and Helmut Schwichtenberg. Program development by proof transformation. In H. Schwichtenberg, editor, Proof and Computation, volume 139 of Series F: Computer and Systems Sciences, pages 1–45. NATO Advanced Study Institute, International Summer School held in Marktoberdorf, Germany, July 20–August 1, 1993, Springer Verlag, Berlin, Heidelberg, New York, 1995.Google Scholar
  2. [2]
    Ulrich Berger and Helmut Schwichtenberg. Program extraction from classical proofs. In D. Leivant, editor, Logic and Computational Complexity, International Workshop LCC '94, Indianapolis, IN, USA, October 1994, volume 960 of Lecture Notes in Computer Science, pages 77–97. Springer Verlag, Berlin, Heidelberg, New York, 1995.Google Scholar
  3. [3]
    Harvey Friedman. Classically and intuitionistically provably recursive functions. In D.S. Scott and G.H. Müller, editors, Higher Set Theory, volume 669 of Lecture Notes in Mathematics, pages 21–28. Springer Verlag, Berlin, Heidelberg, New York, 1978.Google Scholar
  4. [4]
    Georg Kreisel. Interpretation of analysis by means of constructive functionals of finite types. In A. Heyting, editor, Constructivity in Mathematics, pages 101–128. North-Holland, Amsterdam, 1959.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • U. Berger
  • H. Schwichtenberg

There are no affiliations available

Personalised recommendations