Abstract
We have shown, that effectively given domains can be characterized as retracts of a universal domain using the new concept of recursive elements. It would be of interest to prove the existence of a universal domain for the case of bounded complete cpo's. We conjecture, that in such a universal domain the effectively given bounded complete domains can again be characterized by recursive partial closures.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Kanda, A.: Effective solutions of recursive domain equations, dissertation, Warwick, (1979).
Kanda, A., Park, D.: When two effectively given domains are identical?, Proc. of the 4th GI Theoretical Computer Science Symposium, LNCS 67, 170–181, (1979).
Plotkin. G.: IIω as a universal domain, JCSS, 17, 209–236, (1978).
Plotkin. G.: Lecture notes distributed at the Advanced Seminar on Semantics in Antibe, France, (1977).
Sciore, E., Tang, A.: Admissible coherent c.p.o.'s, LNCS 62, 440–456, (1978).
Symth, M.: Effectively given domains, Theoretical Computer Science, 5, 257–274, (1977).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Josko, B. (1981). An effective retract calculus. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017310
Download citation
DOI: https://doi.org/10.1007/BFb0017310
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive