Article

Program extraction in simply-typed higher order logic

Author:

Stefan BerghoferAuthors Info & Claims

TYPES'02: Proceedings of the 2002 international conference on Types for proofs and programs

Pages 21 - 38

Published: 24 April 2002 Publication History

Abstract

Based on a representation of primitive proof objects as λ-terms, which has been built into the theorem prover Isabelle recently, we propose a generic framework for program extraction. We show how this framework can be used to extract functional programs from proofs conducted in a constructive fragment of the object logic Isabelle/HOL. A characteristic feature of our implementation of program extraction is that it produces both a program and a correctness proof. Since the extracted program is available as a function within the logic, its correctness proof can be checked automatically inside Isabelle.

References

[1]

P. Anderson. Program extraction in a logical framework setting. In F. Pfenning, editor, Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning, volume 822 of LNAI, pages 144-158. Springer-Verlag, July 1994.

Digital Library

[2]

A. Ayari and D. Basin. A higher-order interpretation of deductive tableau. Journal of Symbolic Computation, 31(5):487-520, May 2001.

Digital Library

[3]

B. Barras, S. Boutin, C. Cornes, J. Courant, Y. Coscoy, D. Delahaye, D. de Rauglaudre, J.-C. Filliâtre, E. Giménez, H. Herbelin, G. Huet, H. Laulhère, C. Muñoz, C. Murthy, C. Parent-Vigouroux, P. Loiseleur, C. Paulin-Mohring, A. Saïbi, and B. Werner. The Coq proof assistant reference manual - version 7.2. Technical Report 0255, INRIA, February 2002.

[4]

G. Bauer and T. Nipkow. The 5 colour theorem in Isabelle/Isar. In V. Carreño, C. Muñoz, and S. Tahar, editors, Theorem Proving in Higher Order Logics, volume 2410 of LNCS, pages 67-82. Springer-Verlag, 2002.

Digital Library

[5]

H. Benl, U. Berger, H. Schwichtenberg, M. Seisenberger, and W. Zuber. Proof theory at work: Program development in the Minlog system. In W. Bibel and P. Schmitt, editors, Automated Deduction - A Basis for Applications, volume II: Systems and Implementation Techniques of Applied Logic Series, pages 41-71. Kluwer Academic Publishers, Dordrecht, 1998.

[6]

U. Berger, W. Buchholz, and H. Schwichtenberg. Refined program extraction from classical proofs. Annals of Pure and Applied Logic, 114:3-25, 2002.

[7]

U. Berger, H. Schwichtenberg, and M. Seisenberger. The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction. Journal of Automated Reasoning, 26:205-221, 2001.

Digital Library

[8]

S. Berghofer and T. Nipkow. Proof terms for simply typed higher order logic. In J. Harrison and M. Aagaard, editors, Theorem Proving in Higher Order Logics: TPHOLs 2000, volume 1869 of LNCS. Springer-Verlag, 2000.

Digital Library

[9]

S. Berghofer and T. Nipkow. Executing higher order logic. In P. Callaghan, Z. Luo, J. McKinna, and R. Pollack, editors, Types for Proofs and Programs: TYPES'2000, volume 2277 of LNCS. Springer-Verlag, 2002.

Digital Library

[10]

M. D. Coen. Interactive program derivation. PhD thesis, Cambridge University, November 1992.

[11]

R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Development System. Prentice-Hall, NJ, 1986.

Digital Library

[12]

T. Coquand. Une Théorie des Constructions. PhD thesis, Université Paris 7, January 1985.

[13]

M. Fernández and P. Severi. An operational approach to program extraction in the Calculus of Constructions. In International Workshop on Logic Based Program Development and Transformation (LOPSTR'02), LNCS. Springer, 2002.

[14]

S. Hayashi and H. Nakano. PX, a Computational Logic. Foundations of Computing. MIT Press, 1988.

Digital Library

[15]

S. Kleene. Introduction to Metamathematics. North Holland, 1952.

[16]

J. McKinna and R. M. Burstall. Deliverables: A categorical approach to program development in type theory. In A. M. Borzyszkowski and S. Sokolowski, editors, Mathematical Foundations of Computer Science 1993, 18th International Symposium, volume 711 of lncs, pages 32-67, Gdansk, Poland, 30 Aug.- 3 Sept. 1993. Springer.

Digital Library

[17]

C. Paulin-Mohring. Extracting Fω's programs from proofs in the Calculus of Constructions. In Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Jan. 1989. ACM.

Digital Library

[18]

C. Paulin-Mohring. Extraction de programmes dans le Calcul des Constructions. Thèse d'université, Paris 7, Jan. 1989.

[19]

C. Paulin-Mohring and B. Werner. Synthesis of ML programs in the system Coq. Journal of Symbolic Computation, 15:607-640, 1993.

Digital Library

[20]

F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In H. Ganzinger, editor, CADE-16, 16th International Conference on Automated Deduction, Trento, Italy, July 7-10, 1999, volume 1632 of Lecture Notes in Computer Science, pages 202-206, 1999.

Digital Library

[21]

P. Severi and N. Szasz. Studies of a theory of specifications with built-in program extraction. Journal of Automated Reasoning, 27 (1):61-87, July 2001.

Digital Library

[22]

M. Wenzel. Type classes and overloading in higher-order logic. In E. L. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics: TPHOLs'97, LNCS 1275, 1997.

Digital Library

[23]

M. Wenzel. Isabelle/Isar -- a versatile environment for human-readable formal proof documents. PhD thesis, Institut für Informatik, TU München, 2002. http: //tumb1.biblio.tu-muenchen.de/publ/diss/in/2002/wenzel.html

Cited By

Wenzel M(2013)Shared-memory multiprocessing for interactive theorem provingProceedings of the 4th international conference on Interactive Theorem Proving10.1007/978-3-642-39634-2_30(418-434)Online publication date: 22-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39634-2_30
Rahli VBickford MAnand A(2013)Formal program optimization in nuprl using computational equivalence and partial typesProceedings of the 4th international conference on Interactive Theorem Proving10.1007/978-3-642-39634-2_20(261-278)Online publication date: 22-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39634-2_20
Aransay JBallarin CRubio J(2005)Extracting computer algebra programs from statementsProceedings of the 10th international conference on Computer Aided Systems Theory10.1007/11556985_21(159-168)Online publication date: 7-Feb-2005
https://dl.acm.org/doi/10.1007/11556985_21
Show More Cited By

Program extraction in simply-typed higher order logic

Recommendations

Higher-order abstract syntax in classical higher-order logic
LFMTP '09: Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice

Higher-Order Abstract Syntax, or HOAS, is a technique for using a higher-order logic as a metalanguage for an object language with binding operators. It avoids formalizing syntactic details related to variable binding. This paper gives an extension to ...
Automated Reasoning in Higher-order Logic: Set Comprehension and Extensionality in Church's Type Theory
Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover
TPHOLs '00: Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics

We present an implementation of a program logic of objects, extending that (AL) of Abadi and Leino. In particular, the implementation uses higher-order abstract syntax (HOAS) and--unlike previous approaches using HOAS--at the same time uses the built-in ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

TYPES'02: Proceedings of the 2002 international conference on Types for proofs and programs

April 2002

331 pages

ISBN:354014031X

Editors:
Herman Geuvers
University of Nijmegen, Department of Computer Science, Nijmegen, The Netherlands
,
Freek Wiedijk
University of Nijmegen, Department of Computer Science, Nijmegen, The Netherlands

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 24 April 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wenzel M(2013)Shared-memory multiprocessing for interactive theorem provingProceedings of the 4th international conference on Interactive Theorem Proving10.1007/978-3-642-39634-2_30(418-434)Online publication date: 22-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39634-2_30
Rahli VBickford MAnand A(2013)Formal program optimization in nuprl using computational equivalence and partial typesProceedings of the 4th international conference on Interactive Theorem Proving10.1007/978-3-642-39634-2_20(261-278)Online publication date: 22-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39634-2_20
Aransay JBallarin CRubio J(2005)Extracting computer algebra programs from statementsProceedings of the 10th international conference on Computer Aided Systems Theory10.1007/11556985_21(159-168)Online publication date: 7-Feb-2005
https://dl.acm.org/doi/10.1007/11556985_21
Berghofer S(2004)Extracting a normalization algorithm in Isabelle/HOLProceedings of the 2004 international conference on Types for Proofs and Programs10.1007/11617990_4(50-65)Online publication date: 15-Dec-2004
https://dl.acm.org/doi/10.1007/11617990_4

View Options

View options

Figures

Tables

Media

View Table of Conten