This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Plotkin, \(\mathbb{T}^\omega \) as a universal domain, University of Edinburgh, 1977.
H. Rogers, Theory of recursive functions and effective computability, McGraw-Hill.
D. Scott, Continuous lattices, Lecture notes in mathematics, no. 274, Springer Verlag.
D. Scott, Outline of a mathematical theory of computation, Proc. 4th Annual Princeton Conference on Information Science and Systems, 1970.
D. Scott, Data types as lattices, Siam Journal on Computing, 1976.
M. Smyth, Effectively given domains, University of Warwick, 1976.
A. Tang, Recursion theory in effectively given T0-spaces, Oxford University, 1974.
E. Sciore and A. Tang, Computability theory in admissible domains, Princeton University, 1977.
E. Sciore and A. Tang, Effective domains, Princeton University, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sciore, E., Tang, A. (1978). Admissible coherent c.p.o.'s. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_33
Download citation
DOI: https://doi.org/10.1007/3-540-08860-1_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08860-8
Online ISBN: 978-3-540-35807-7
eBook Packages: Springer Book Archive