Abstract
As we have already noted, cpo’s are used for defining the semantics of programming languages. In the theory of semantics, cpo’s which satisfy certain recursion equations are needed. Different formalisms for solving such recursion equations have been developed. In this chapter we shall use the cpo theory itself for studying an appropriate class of cpo’s. We shall construct a “super cpo”, the elements of which are cpo’s and solve fixed point equations by applying the fixed point operator to appropriate computable functions on the super cpo.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Weihrauch, K. (1987). Solving Domain Equations. In: Computability. EATCS Monographs on Theoretical Computer Science, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69965-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-69965-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-69967-2
Online ISBN: 978-3-642-69965-8
eBook Packages: Springer Book Archive