{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:29Z","timestamp":1725456089270},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354015650X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015748","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:45:47Z","timestamp":1132724747000},"page":"232-243","source":"Crossref","is-referenced-by-count":1,"title":["A universal domain technique for profinite posets"],"prefix":"10.1007","author":[{"given":"Carl A.","family":"Gunter","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Gunter, C. 1985 Profinite Solutions for Recursive Domain Equations. Doctoral Dissertation, University of Wisconsin, Madison, 1985, 181 pp."},{"key":"23_CR2","unstructured":"Kamimura, T. and Tang, A. 1984 Finitely Continuous Posets. Technical Report, no. TR-84-1, University of Kansas, 1984, 26 pp."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Lambek, J. and Scott, P.J. 1984 Introduction to Higher-Order Categorical Logic Pre-print, 1984, 200+ pp.","DOI":"10.1090\/conm\/030\/749773"},{"key":"23_CR4","unstructured":"MacQueen, D., Plotkin, G. D. and Sethi, R. 1984 An ideal model for recursive polymorhpic types. In: Eleventh Symposium on Principles of Programming Languages, edited by K. Kennedy. Association for Computing Machinery, 1984, pp. 165\u2013174."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G.D. Plotkin","year":"1976","unstructured":"1976 A powerdomain construction. SIAM Journal of Computing, vol. 5 (1976), pp. 452\u2013487.","journal-title":"SIAM Journal of Computing"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(78)90006-5","volume":"17","author":"G. D. Plotkin","year":"1978","unstructured":"1978 T w as a universal domain. Journal of Computer System Sciences, vol. 17 (1978b), pp.209\u2013236.","journal-title":"Journal of Computer System Sciences"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BFb0073967","volume":"274","author":"D. S. Scott","year":"1972","unstructured":"1972 Continuous Lattices. In: Toposes, Algebraic Geometry and Logic, edited by F. W. Lawvere. Lecture Notes in Mathematics, vol. 274, Springer-Verlag, 1972, pp. 97\u2013136.","journal-title":"Lecture Notes in Mathematics"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. S. Scott","year":"1976","unstructured":"1976 Data types as lattices. SIAM Journal of Computing, vol. 5 (1976), pp. 522\u2013587.","journal-title":"SIAM Journal of Computing"},{"key":"23_CR9","unstructured":"Scott, D. S. 1981a Lectures on a mathematical theory of computation. Technical Report, no. PRG-19, Oxford University Computing Laboratory, 1981a, 148 pp."},{"key":"23_CR10","unstructured":"Scott, D. S. 1981b Some ordered sets in computer science. In: Ordered Sets, edited by I. Rival. D. Reidel Publishing Company, 1981b, pp. 677\u2013718."},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/BFb0012801","volume":"140","author":"D. S. Scott","year":"1982","unstructured":"1982 Domains for denotational semantics. In: ICALP 82, edited by M. Nielsen, E. M. Schmidt. Lecture Notes in Computer Science, vol. 140, Springer-Verlag, 1982, pp. 577\u2013613.","journal-title":"Lecture Notes in Computer Science"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(83)90095-6","volume":"27","author":"M. B. Smyth","year":"1983","unstructured":"Smyth, M. B. 1983 The largest cartesian closed category of domains. Theoretical Computer Science, vol. 27 (1983), pp. 109\u2013119.","journal-title":"Theoretical Computer Science"},{"key":"23_CR13","unstructured":"Stoy, J. E. 1977 Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. M.I.T. Press, 1977, 414 pp."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:20:27Z","timestamp":1586578827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354015650X"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0015748","relation":{},"subject":[]}}