Abstract
In this article, we introduce finite auxiliary relations and show that in a domain given by a retract of Plotkin's SFP object, Scott's way-below relation can be obtained as the union of an ascending chain of finite auxiliary relations.
This work was supported by National Science Foundation Grant DCR-8415919.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. Gierz, K. Hofman, K. Kiemel, J. Lawson, M. Mislove and D. Scott, A Compendium of Continuous Lattices, Springer Verlag, 1981.
C. Gunter, Profinite solutions for Recursive Domain Equations, Ph.D. dissertation, University of Wisconsin, 1985.
T. Kamimura and A. Tang, Retracts of SFP objects, Lecture Notes in Computer Science 239, 1986, 135–148.
T. Kamimura and A. Tang, Domains as Finitely Continuous CPOs, Technical Report, 1987.
G. Plotkin, A Powerdomain Construction, SIAM Journal of Computing, vol. 5, no. 3, 1976, 452–487.
D. Scott, Continuous Lattices, Lecture Notes in Mathematics 274, 1970, 97–136.
D. Scott, Data Types as Lattices, SIAM Journal of Computing, vol. 5, no. 3, 1976, 522–587.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kamimura, T., Tang, A. (1988). Continuous auxiliary relations. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Language Semantics. MFPS 1987. Lecture Notes in Computer Science, vol 298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19020-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-19020-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19020-2
Online ISBN: 978-3-540-38920-0
eBook Packages: Springer Book Archive