Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algebraic Methodology and Software Technology

AMAST 1997: Algebraic Methodology and Software Technology pp 16–29Cite as

Head-tactics simplification

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1349))

Abstract

Tactics are commands used to guide goal-directed proofs in interactive proof environments. This paper presents various possible simplifications on tactic expression and provides a justification for these simplifications, based on a precise description of the way tactics operate. In particular, this paper introduces a class of head-oriented tactics that are especially suited for simplification. Most of these simplifications have been developed in an simplifier coupled with a tactic generator based on mouse interaction.

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. Janet Bertot and Yves Bertot. CtCoq: A system presentation. In Automated Deduction (CADE-13), volume 1104 of Lecture Notes in Artificial Intelligence, pages 231–234. Springer-Verlag, July 1996.

    Google Scholar 

  2. Yves Bertot, Gilles Kahn, and Laurent Théry. Proof by pointing. In Theoretical Aspects of Computer Software, volume 789 of Lecture Notes in Computer Science, pages 141–160, 1994.

    Google Scholar 

  3. Yves Bertot, Thomas Schreiber, and Dilip Sequeira. Proof by pointing in a weakly structured context. ftp://ftp.dcs.ed.ac.uk/pub/lego/pbp/main.ps.

    Google Scholar 

  4. Yves Bertot and Laurent Théry. A generic approach to building user interfaces for theorem provers. To appear in Journal of Symbolic Computation.

    Google Scholar 

  5. Patrick Borras, Dominique Clément, Thierry Despeyroux, Janet Incerpi, Gilles Kahn, Bernard Lang, and Valérie Pascual. Centaur: the system. In Third Symposium on Software Development Environments, 1988. (Also appears as INRIA Report no. 777).

    Google Scholar 

  6. Debra Cameron and Bill Rosenblatt. Learning GNU Emacs. O'Reilly & Associates, Inc., 1991.

    Google Scholar 

  7. Robert Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harber, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing mathematics with the Nuprl proof development system. Prentice-Hall, 1986.

    Google Scholar 

  8. Amy Felty. Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language. PhD thesis, University of Pennsylvania, 1989.

    Google Scholar 

  9. Amy Felty and Douglas Howe. Tactic theorem proving with refinement-tree proofs and metavariables. In Automated Deduction(CADE-12), volume 814 of Lecture Notes in Computer Science. Springer-Verlag, June 1995.

    Google Scholar 

  10. Amy Felty and Laurent Théry. Interactive theorem proving with temporal logic. To appear in Journal of Symbolic Computation.

    Google Scholar 

  11. Michael Gordon and Thomas Melham. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.

    Google Scholar 

  12. Timothy Griffin. Notational definition and top-down refinement for interactive proof development systems. PhD thesis, Cornell University, 1988.

    Google Scholar 

  13. INRIA. The Coq Proof Assistant Reference Manual, December 1996. Version6.1.

    Google Scholar 

  14. The LEGO World Wide Web page. url http://www.dcs.ed.ac.uk/home/lego.

    Google Scholar 

  15. Lena Magnusson and Bengt Nordström. The ALF proof editor and its proof engine. In Types for Proofs and Programs, volume 806 of Lecture Notes in Computer Science, pages 213–237. Springer-Verlag, 1994.

    Google Scholar 

  16. Per Martin-Löf. Intuitionistic type theories. Bibliopolis, 1984.

    Google Scholar 

  17. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990. ISBN 0-262-63132-6.

    Google Scholar 

  18. Lawrence C. Paulson. Logic and computation, Interactive proof with Cambridge LCF. Cambridge University Press, 1987.

    Google Scholar 

  19. Lawrence C. Paulson. ML for the working programmer. Cambridge University Press, 1991.

    Google Scholar 

  20. Lawrence C. Paulson and Tobias Nipkow. Isabelle: a generic theorem prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  21. Laurent Théry. A proof development system for the HOL theorem prover. In Higher Order Logic theorem proving and its applications, volume 780 of Lecture Notes in Computer Science. Springer-Verlag, August 1993.

    Google Scholar 

  22. Laurent Théry, Yves Bertot, and Gilles Kahn. Real Theorem Provers Deserve Real User-Interfaces. Software Engineering Notes, 17(5), 1992. Proceedings of the 5th Symposium on Software Development Environments.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Sophia Antipolis, Bulgaria

    Yves Bertot

Authors
  1. Yves Bertot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Johnson

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertot, Y. (1997). Head-tactics simplification. In: Johnson, M. (eds) Algebraic Methodology and Software Technology. AMAST 1997. Lecture Notes in Computer Science, vol 1349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000460

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63888-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation