Advertisement

Structured theories in LCF

  • D. T. Sannella
  • R. M. Burstall
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 159)

Abstract

An extension to the Edinburgh LCF interactive theorem-proving system is described which provides new ways of constructing theories, drawing upon ideas from the Clear specification language. A new theory can be built from an existing theory in two new ways: by renaming its types and constants, or by abstraction (forgetting some types and constants and perhaps renaming the rest). A way of providing parameterised theories is described. These theory-building operations — together with operations for forming a primitive theory and for taking the union of theories — allow large theories to be built in a flexible and well-structured fashion. Inference rules and strategies for proof in structured theories are also discussed.

Keywords

Structure Theory Inference Rule Type Operator Springer Lecture Note Proof Strategy 
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.

8 References

  1. [ADJ 78]
    Thatcher, J.W., Wagner, E.G. and Wright, J.B. Data type specification: parameterization and the power of specification techniques. SIGACT 10th Annual Symp. on the Theory of Computing, San Diego, California.Google Scholar
  2. [ASM 79]
    Abrial, J.R., Schuman, S.A. and Meyer, B. Specification language Z. Massachusetts Computer Associates Inc., Boston, Massachusetts.Google Scholar
  3. [Bau 81]
    Bauer, F.L. et al (the CIP Language Group) Report on a wide spectrum language for program specification and development. Report TUM-18104, Technische Univ. MUnchen.Google Scholar
  4. [BG 77]
    Burstall, R.M. and Goguen, J.A. Putting theories together to make specifications. Proc. 5th Intl. Joint Conf. on Artificial Intelligence, Cambridge, Massachusetts, pp. 1045–1058.Google Scholar
  5. [BG 80]
    Burstall, R.M. and Goguen, J.A. The semantics of Clear, a specification language. Proc. of Advanced Course on Abstract Software Specifications, Copenhagen. Springer Lecture Notes in Computer Science, Vol. 86, pp. 292–332.Google Scholar
  6. [Cohn 79]
    Cohn, A.J. Machine assisted proofs of recursion implementation. Ph.D. thesis, Dept. of Computer Science, Univ. of Edinburgh.Google Scholar
  7. [DJ 80]
    Davenport, J.H. and Jenks, R.D. MODLISP. Proc. 1980 LISP Conference, Stanford, California, pp. 65–74.Google Scholar
  8. [GB 82]
    Goguen, J.A. and Burstall, R.M. Institutions: Iogic and specification. Draft report, SRI International.Google Scholar
  9. [GMW 79]
    Gordon, M.J., Milner, A.J.R. and Wadsworth, C.P. Edinburgh LCF. Springer Lecture Notes in Computer Science, Vol. 78.Google Scholar
  10. [GHM 78]
    Guttag, J.V., Horowitz, E. and Musser, D.R. Abstract data types and software validation. CACM 21, 12 pp. 1048–1064.Google Scholar
  11. [HN 79]
    Honda, M. and Nakajima, R. Interactive theorem proving on hierarchically and modularly structured sets of very many axioms. Proc. 6th Intl. Joint Conf. on Artificial Intelligence, Tokyo, pp. 400–402.Google Scholar
  12. [Les 82]
    Leszczylowski, J. META SYSTEM. Preliminary draft report, Institute of Computer Science, Polish Academy of Sciences.Google Scholar
  13. [LW 82]
    Leszczylowski, J. and Wirsing, M. A system for reasoning within and about algebraic specifications. Proc. 5th Intl. Symp. on Programming, Turin. Springer Lecture Notes in Computer Science, Vol. 137, pp. 257–282.Google Scholar
  14. [NHN 80]
    Nakajima, R., Honda, M. and Nakahara, H. Hierarchical program specification and verification — a many-sorted logical approach. Acta Informatica 14 pp. 135–155.Google Scholar
  15. [NO 79]
    Nelson, G. and Oppen, D.C. Simplification by cooperating decision procedures. TOPLAS 1, 2 pp. 245–257.Google Scholar
  16. [San 82]
    Sannella, D.T. Semantics, implementation and pragmatics of Clear, a program specification language. Ph.D. thesis, Dept. of Computer Science, Univ. of Edinburgh.Google Scholar
  17. [San 82a]
    Sannella, D.T. A new semantics for Clear. To appear in Acta Informatica. Also Report CSR-79-81, Dept. of Computer Science, Univ. of Edinburgh.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • D. T. Sannella
    • 1
  • R. M. Burstall
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghUK

Personalised recommendations