Abstract
In the previous chapter operational semantics for various programming languages were introduced. All these operational semantics had something in common: the meaning MF(S) of a program S (in an interpretation F) was defined algorithmically, namely with help of computation sequences. In other words, to each program an algorithm was associated which computes the function MF(S) or, more precisely, which computes the value of MF(S) (called output value) for any argument (called input value).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Historical and Bibliographical Remarks
Kleene, S. C.: Introduction to MetamathematicsNorth-Holland, 1952.
de Bakker, J. W. and Scott, D.: A theory of programs, IBM Seminar, unpublished notes, 1969.
Scott, D.: Outline of a mathematical theory of computation, 4th Annual Princeton Conf. Inform. Sc. and Systems, pp. 169–176, 1970.
Park, D.: Fixpoint induction and proofs of program properties, Machine Intelligence, 5 (ed. B. Meltzer and D. Michie), pp. 59–78, Edinburgh Univ. Press, 1969.
Stoy, J. E.: Denotational Semantics: The Scott—Strachey Approach to Programming Language Theory, M.I.T. Press, 1977.
Milne, R. and Strachey, C.: A Theory of Programming Language Semantics, Chapman and Hall, 1976.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Loeckx, J., Sieber, K. (1987). Fixpoints in Complete Partial Orders. In: The Foundations of Program Verification. Series in Computer Science. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-96753-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-322-96753-4_4
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-322-96754-1
Online ISBN: 978-3-322-96753-4
eBook Packages: Springer Book Archive