Advertisement

Encoding \(\mathcal{W}\): A Logic for Z in 2OBJ

  • Andrew Martin
Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 670)

Abstract

A prototype proof system for “\(\mathcal{W}\): A Logic for Z” has been produced using the 2OBJ metalogical theorem-prover. 2OBJ permits an encoding which is very similar in structure to that of \(\mathcal{W}\), and the details are presented here. Like \(\mathcal{W}\)the encoding assumes that all its inputs are well-typed. The structure of the encoding is enhanced by a meta-rule on the lifting of proof rules and tactics. There is some discussion of how tactics can make \(\mathcal{W}\)more easily usable.

Keywords

Inference Rule Sequent Calculus Proof Obligation Concrete Syntax Proof Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jean-Raymond Abrial. A formal introduction to mathematical reasoning. Technical report, BP Research International, 1991.Google Scholar
  2. 2.
    Joseph Goguen, Andrew Stevens, Hendrik Hilberdink, and Keith Hobley. 2OBJ: A Metalogical Theorem Prover based on Equational Logic. Philosophical Transactions of the Royal Society, Series A, 1992.Google Scholar
  3. 3.
    Joseph Goguen and Timothy Winkler. Introducing OBJ3. Technical Report SRI-CSL-88-9, SRI International, Computer Science Lab, August 1988.Google Scholar
  4. 4.
    M. J. C. Gordon. HOL: A proof generating system for higher-order logic. In G. Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis. Kluwer Academic Publishers, 1988.Google Scholar
  5. 5.
    M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of LNCS. Springer-Verlag, 1979.Google Scholar
  6. 6.
    Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Report series, LFCS, Department of Computer Science, University of Edinburgh, 1991.Google Scholar
  7. 7.
    Hendrik B. Hilberdink. Oxford DPhil Thesis, To appear.Google Scholar
  8. 8.
    C. B. Jones, K. D. Jones, P. A. Lindsay, and R. Moore. mural: A Formal Development Support System. Springer Verlag, 1991.Google Scholar
  9. 9.
    Lawrence C. Paulson. Logic and Computation—Interactive Proof with Cambridge LCF. CUP, 1987.Google Scholar
  10. 10.
    Lawrence C. Paulson. The foundation of a generic theorem prover. Technical report, Computer Laboratory, University of Cambridge, 1988.Google Scholar
  11. 11.
    Lawrence C. Paulson. A preliminary user's manual for Isabelle. Technical report, Computer Laboratory, University of Cambridge, 1988.Google Scholar
  12. 12.
    J. Michael Spivey. The Fuzz Manual. Computing Science Consultancy, 2 Willow Close, Garsington, Oxford OX9 9AN, UK, 1988.Google Scholar
  13. 13.
    Z Base Standard, March 1992. Version 0.5.Google Scholar
  14. 14.
    Andrew Stevens and Keith Hobley. Mechanized Theorem Proving with 2OBJ: A Tutorial Introduction, 1992.Google Scholar
  15. 15.
    J. C. P. Woodcock and S.M. Brien. \(\mathcal{W}\): A Logic for Z. In Proceedings 6th Z User Meeting. Springer-Verlag, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Andrew Martin
    • 1
  1. 1.Programming Research GroupOxford University Computing LaboratoryOxfordUK

Personalised recommendations