Skip to main content

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 91))

  • 196 Accesses

Abstract

A formal theory is a four-tuple:

  1. 1)

    A countable set of symbols; sequences of symbols are called expressions.

  2. 2)

    A subset of the expressions, called the well-formed formulas (WFFs).

  3. 3)

    A subset of the WFFs, known as the set of axioms.

  4. 4)

    A finite set {R1,…, Rn} of mappings between WFFs, called rules of inference. If rule R maps WFFs w1 and w2 onto w3, we say that w3 is derived from w1 and w2 by rule R.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ruth Davis, Runnable Specification As a Design Tool, Proceedings of the Logic Programming Workshop, Debrecen, Hungary, July 14–16, 1980.

    Google Scholar 

  2. John Guttag, The Specification and Application to Programming of Abstract Data Types, Ph.D. Thesis, University of Toronto, 1975.

    Google Scholar 

  3. John Guttag and J. Horning, “Formal Specification As a Design Tool, Proceedings of the ACM Symposium on Principles of Programming Languages,1980.

    Google Scholar 

  4. C.A.R. Hoare, Proof of a Program: Find. CACM 14 January, 1971.

    Google Scholar 

  5. Robert Kowalski, Logic for Problem Solving, North Holland Publishing, New York, 1979.

    MATH  Google Scholar 

  6. J.A. Robinson, Computational Logic: The Unification Computation, Machine Intelligence 6, Edinburgh University Press, New York, 1971.

    Google Scholar 

  7. Sharon Sickel and W.M. McKeeman, Hoare’s Program Find Revisited, Proceedings of the Logic Programming Workshop, Debrecen, Hungary, July 14–16, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 D. Reidel Publishing Company

About this chapter

Cite this chapter

Sickel, S. (1982). Specification and Derivation of Programs. In: Broy, M., Schmidt, G. (eds) Theoretical Foundations of Programming Methodology. NATO Advanced Study Institutes Series, vol 91. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7893-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-7893-5_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-277-1462-6

  • Online ISBN: 978-94-009-7893-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics