Specification and Derivation of Programs
Chapter
Abstract
A formal theory is a four-tuple:
- 1)
A countable set of symbols; sequences of symbols are called expressions.
- 2)
A subset of the expressions, called the well-formed formulas (WFFs).
- 3)
A subset of the WFFs, known as the set of axioms.
- 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.
Keywords
Binary Tree Empty Tree Prolog Interpreter Logic Interpreter Procedure Lookup
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.
References
- [Davis,1980]Ruth Davis, Runnable Specification As a Design Tool, Proceedings of the Logic Programming Workshop, Debrecen, Hungary, July 14–16, 1980.Google Scholar
- [Guttag, 1975]John Guttag, The Specification and Application to Programming of Abstract Data Types, Ph.D. Thesis, University of Toronto, 1975.Google Scholar
- [Guttag/Horning,1980]John Guttag and J. Horning, “Formal Specification As a Design Tool, Proceedings of the ACM Symposium on Principles of Programming Languages,1980.Google Scholar
- [Hoare,1971]C.A.R. Hoare, Proof of a Program: Find. CACM 14 January, 1971.Google Scholar
- [Kowalski,1979]Robert Kowalski, Logic for Problem Solving, North Holland Publishing, New York, 1979.MATHGoogle Scholar
- [Robinson,1971]J.A. Robinson, Computational Logic: The Unification Computation, Machine Intelligence 6, Edinburgh University Press, New York, 1971.Google Scholar
- [Sickel/McKeeman,1980]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
Copyright information
© D. Reidel Publishing Company 1982