Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic for Programming Artificial Intelligence and Reasoning

LPAR 1992: Logic Programming and Automated Reasoning pp 202–213Cite as

Building proofs by analogy via the Curry-Howard Isomorphism

  • Session 8: Logical Frameworks
  • Conference paper
  • First Online:

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

Abstract

We present a formal method for building proofs by analogy and its implementation as a proof tactic for the NuPRL proof development system. The Curry-Howard Isomorphism is used to represent proof constructions in a term-functional language and to specify analogies by transformation rules on these terms. The method has the advantage to admit complete formalization and to make use of well-known techniques like higher-order unification.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Brock, S. Cooper, and W. Pierce. Analogical reasoning and proof discovery. In Proc. CADE-9, LNCS 310, pages 454–468. Springer Verlag, 1988.

    Google Scholar 

  2. T. Boy de la Tour and R. Caferra. Proof analogy in interactive theorem proving: A method to express and use it via second order matching. In Proc. AAAI-S7, pages 95–99. Morgan Kaufmann, 1987.

    Google Scholar 

  3. T. Boy de la Tour and R. Caferra. A formal approach to some usually informal techniques used in mathematical reasoning. In Proc. Int'l Symposium on Symbolic and Algebraic Computation, pages 402–406. LNCS 358, Springer, 1988.

    Google Scholar 

  4. R. L. Constable et.al. Implementing Mathematics with the NuPRL proof development system. Prentice Hall, Englewood Cliffs, NJ, 1986.

    Google Scholar 

  5. H. B. Curry, R. Feys, and W. Craig. Combinatory Logic, volume 1. North-Holland, Amsterdam, 1958.

    Google Scholar 

  6. R. L. Constable and D. J. Howe. NuPRL as a general logic. In P. Odifreddi, editor, Logic and Computer Science, pages 77–90. Academic Press, 1990.

    Google Scholar 

  7. D. M. Gabbay and R. de Queiroz. Extending the Curry-Howard interpretation to linear, relevant and other resource logics. In Logic Colloquium'90, 1990.

    Google Scholar 

  8. G. Gentzen. Untersuchungen über das logische Schließen. Math. Zeitschrift, 39:176–210, 405–431, 1935.

    Article  Google Scholar 

  9. M. J. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF: A mechanized Logic of Computation. LNCS 78. Springer Verlag, 1979.

    Google Scholar 

  10. G. P. Huet and B. Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31–55, 1978.

    Article  Google Scholar 

  11. G. P. Huet. A unification algorithm for typed λ-calculus. TCS, 1:27–57, 1975.

    Article  Google Scholar 

  12. R. E. Kling. A paradigm for reasoning by analogy. AI-Journal, 2:147–178, 1971.

    Google Scholar 

  13. P. Martin-Löf. Constructive mathematics and computer programming. In 6-th International Congress for Logic, Methodology and Philosophy of Science, pages 153–175. North-Holland, 1982.

    Google Scholar 

  14. D. A. Plaisted. Theorem proving with abstraction. AI-Journal, 16:47–108, 1981.

    Google Scholar 

  15. W. Snyder and J. Gallier. Higher-order unification revisited: Complete sets of transformations. Journal of Symbolic Computation, 8(1&2):101–140, 1989.

    Google Scholar 

  16. W. W. Tait. Intensional interpretation of functionals of finite type. Journal of Symbolic Logic, 32(2):187–199, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle - IMAG - CNRS, 46, avenue Félix Viallet, 38031, Grenoble cedex, France

    Thierry Boy de la Tour

  2. Fachgebiet Intellektik, Fachbereich Informatik, Technische Hochschule Darmstadt, Alexanderstraße 10, D-6100, Darmstadt, Germany

    Christoph Kreitz

Authors
  1. Thierry Boy de la Tour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Kreitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de la Tour, T.B., Kreitz, C. (1992). Building proofs by analogy via the Curry-Howard Isomorphism. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013062

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55727-2

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation