Proof style

  • John Harrison
Conference paper

DOI: 10.1007/BFb0097791

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1512)
Cite this paper as:
Harrison J. (1998) Proof style. In: Giménez E., Paulin-Mohring C. (eds) Types for Proofs and Programs. TYPES 1996. Lecture Notes in Computer Science, vol 1512. Springer, Berlin, Heidelberg

Abstract

We are concerned with how computer theorem provers should expect users to communicate proofs to them. There are many stylistic choices that still allow the machine to generate a completely formal proof object. The most obvious choice is the amount of guidance required from the user, or from the machine perspective, the degree of automation provided. But another important consideration, which we consider particularly significant, is the bias towards a ‘procedural’ or ‘declarative’ proof style. We will explore this choice in depth, and discuss the strengths and weaknesses of declarative and procedural styles for proofs in pure mathematics and for verification applications. We conclude with a brief summary of our own experiments in trying to combine both approaches.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • John Harrison
    • 1
  1. 1.Computer Laboratory New Museums SiteUniversity of CambridgeCambridgeEngland

Personalised recommendations