This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, U., Schwichtenberg, H. (1996). The greatest common divisor: A case study for program extraction from classical proofs. In: Berardi, S., Coppo, M. (eds) Types for Proofs and Programs. TYPES 1995. Lecture Notes in Computer Science, vol 1158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61780-9_60
Download citation
DOI: https://doi.org/10.1007/3-540-61780-9_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61780-8
Online ISBN: 978-3-540-70722-6
eBook Packages: Springer Book Archive