{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:16Z","timestamp":1725663256842},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_36","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:42:45Z","timestamp":1330206165000},"page":"116-142","source":"Crossref","is-referenced-by-count":3,"title":["Effectively given information systems and domains"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"G\u00f6bel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"8_CR1","unstructured":"S. Abramsky, Domain Theory and the Logic of Observables Properties, PhD Thesis, QMC, University of London, 1987."},{"key":"8_CR2","unstructured":"S. Abramsky, Domain Theory In Logical Form, submitted to Ann. Pure and Appl. Logic (1988)."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"G. Berry and P.L. Curien, Sequential algorithms on concrete data structures, Theoret. Comp. Sci. 20 (1982), 265\u2013321.","journal-title":"Theoret. Comp. Sci."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"M. Coppo, M. Dezani, G. Longo, Applicative information systems, Note Scientifiche S-83-5, Febbraio 1983.","DOI":"10.1007\/3-540-12727-5_2"},{"issue":"3","key":"8_CR5","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1112\/plms\/s3-50.3.447","volume":"50","author":"A.L.S. Corner","year":"1985","unstructured":"A.L.S. Corner, R. G\u00f6bel, Prescribing endomorphism algebras \u2014 A unified treatment, Proceed. London Math. Soc. (3) 50 (1985) 447\u2013479.","journal-title":"Proceed. London Math. Soc."},{"key":"8_CR6","series-title":"Research Notes in Theoretical Computer Science","volume-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"P.L. Curien","year":"1986","unstructured":"P.L. Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Research Notes in Theoretical Computer Science, Pitman, London 1986."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(89)90117-5","volume":"68","author":"M. Droste","year":"1989","unstructured":"M. Droste, Event structures and domains, Theoret. Comp. Sci. 68 (1989), 37\u201347.","journal-title":"Theoret. Comp. Sci."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0890-5401(89)90065-5","volume":"82","author":"M. Droste","year":"1989","unstructured":"M. Droste, Recursive domain equations for concrete data structures, Information and Computation 82 (1989), 65\u201380.","journal-title":"Information and Computation"},{"key":"8_CR9","unstructured":"M. Droste, R. G\u00f6bel, Non-deterministic information systems and their domains, Theoret. Comp. Sci. 73 (1989), to appear."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"E. Engeler, P. L\u00e4uchli, \"Berechnungstheorie f\u00fcr Informatiker\", Teubner Stuttgart 1988.","DOI":"10.1007\/978-3-322-92677-7"},{"key":"8_CR11","unstructured":"A. Kanda, D. Park, When are two effectively given domains identical? in: Springer LNCS 67 (1980) \"Theor. Comp. Science, 4th GI Conference, Aachen 1979\" (ed. K. Weihrauch) pp. 170\u2013181."},{"key":"8_CR12","first-page":"109","volume":"173","author":"K.G. Larsen","year":"1984","unstructured":"K.G. Larsen and G. Winskel, Using information systems to solve recursive domain equations effectively, in: Semantics of Data Types, International Symposium Sophia-Antipolis 1984 (G. Kahn, D.B. MacQueen and G. Plotkin, eds.), Springer LNCS 173 (1984), pp. 109\u2013129.","journal-title":"Springer LNCS"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"L.C. Paulson, Logic and Computation, Interactive Proof with Cambridge LCF, Cambridge UP, Cambridge Tracts in Theoretical Computer Science 1987.","DOI":"10.1017\/CBO9780511526602"},{"key":"8_CR14","unstructured":"D.S. Scott, Outline of a mathematical Theory of computation, Technical Monograph PRG-2 (1970), Oxford."},{"key":"8_CR15","first-page":"97","volume":"274","author":"D.S. Scott","year":"1971","unstructured":"D.S. Scott, Continuous lattices, Proc. 1971 Dalhousie Conference on Toposes, Algebraic Geometry and Logic, Springer LNM 274 (1971), pp. 97\u2013136.","journal-title":"Springer LNM"},{"key":"8_CR16","first-page":"577","volume":"140","author":"D.S. Scott","year":"1982","unstructured":"D.S. Scott, Domains for denotational semantics, Proc. 9th International Coll. on Automata, Languages and Programming, Aarhus, Springer LNCS 140 (1982), pp. 577\u2013613.","journal-title":"Springer LNCS"},{"key":"8_CR17","unstructured":"D.S. Scott, C. Strachey, Toward a Mathematical Semantics for Computer Languages, Proc. Sympos. Computer Sci., Symposia Series 21 (1971)."},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(83)90095-6","volume":"27","author":"M.B. Smyth","year":"1983","unstructured":"M.B. Smyth, The largest cartesian closed category of domains, Theor. Comp. Sci. 27 (1983) 109\u2013119.","journal-title":"Theor. Comp. Sci."},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","volume":"5","author":"M.B. Smyth","year":"1977","unstructured":"M.B. Smyth, Effectively given domains, Theoretical Computer Science 5 (1977) 257\u2013274.","journal-title":"Theoretical Computer Science"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"M.B. Smyth, G. Plotkin, The category\u2014theoretic solution of recursive domain equations, Proc. 18th Symposium on Foundations of Computer Science. Providence, R.I., 1977.","DOI":"10.1109\/SFCS.1977.30"},{"key":"8_CR21","unstructured":"D. Spreen, Computable one\u2014to\u2014one enumerations of effective domains, Springer LNCS 298 (1988) \"Mathematical Foundation of Programming Language Semantics\" (eds. M. Main, A. Melton, M. Mislove, D. Schmidt), pp. 372\u2013384."},{"key":"8_CR22","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Languages","author":"J. Stoy","year":"1977","unstructured":"J. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Languages, MIT Press, Cambridge, Mass. 1977."},{"key":"8_CR23","unstructured":"S. Vickers, \"Topology via Logic\", Cambridge Univ. Press (1989)."},{"key":"8_CR24","unstructured":"M. Wand, Fixed-point constructions in order-enriched categories, Research Report TR 23, Indiana University, 1975."},{"key":"8_CR25","first-page":"325","volume":"255","author":"G. Winskel","year":"1987","unstructured":"G. Winskel, Event structures, in: Springer LNCS 255 (1987) pp. 325\u2013392.","journal-title":"Springer LNCS"}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:08Z","timestamp":1605648308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}