Skip to main content
SpringerLink
Log in

Structured theories in LCF

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP'83 (CAAP 1983)

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

Included in the following conference series:

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8 References

  1. 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. Abrial, J.R., Schuman, S.A. and Meyer, B. Specification language Z. Massachusetts Computer Associates Inc., Boston, Massachusetts.

    Google Scholar 

  3. 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. 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. 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, A.J. Machine assisted proofs of recursion implementation. Ph.D. thesis, Dept. of Computer Science, Univ. of Edinburgh.

    Google Scholar 

  7. Davenport, J.H. and Jenks, R.D. MODLISP. Proc. 1980 LISP Conference, Stanford, California, pp. 65–74.

    Google Scholar 

  8. Goguen, J.A. and Burstall, R.M. Institutions: Iogic and specification. Draft report, SRI International.

    Google Scholar 

  9. Gordon, M.J., Milner, A.J.R. and Wadsworth, C.P. Edinburgh LCF. Springer Lecture Notes in Computer Science, Vol. 78.

    Google Scholar 

  10. Guttag, J.V., Horowitz, E. and Musser, D.R. Abstract data types and software validation. CACM 21, 12 pp. 1048–1064.

    Google Scholar 

  11. 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. Leszczylowski, J. META SYSTEM. Preliminary draft report, Institute of Computer Science, Polish Academy of Sciences.

    Google Scholar 

  13. 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. 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. Nelson, G. and Oppen, D.C. Simplification by cooperating decision procedures. TOPLAS 1, 2 pp. 245–257.

    Google Scholar 

  16. 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. 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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, UK

    D. T. Sannella & R. M. Burstall

Authors
  1. D. T. Sannella
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. M. Burstall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sannella, D.T., Burstall, R.M. (1983). Structured theories in LCF. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

  • Online ISBN: 978-3-540-38714-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation