{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:00Z","timestamp":1725663180733},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_102","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:01:03Z","timestamp":1330171263000},"page":"609-620","source":"Crossref","is-referenced-by-count":4,"title":["Computability in categories"],"prefix":"10.1007","author":[{"given":"M. B.","family":"Smyth","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"49_CR1","unstructured":"Berry, G., Modeles completement adequats et stables des lambda-calculus types, These, Universite Paris VII, 1979."},{"key":"49_CR2","volume-title":"Foundations of Constructive Analysis","author":"E. Bishop","year":"1967","unstructured":"Bishop, E., Foundations of Constructive Analysis, McGraw-Hill (N.Y.), 1967."},{"key":"49_CR3","unstructured":"Constable, R., Constructive mathematics and automatic program writers, IFIP (1972), 229\u2013233."},{"key":"49_CR4","unstructured":"Curien, P., Algorithmes sequentiels sur structures de donnees concretes, These de 3e cycles, Universite Paris VII, 1979."},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Egli, H. & R. Constable, Computability concepts for programming language semantics, Theor. Comp. Sci. 2 (1976).","DOI":"10.1016\/0304-3975(76)90029-3"},{"key":"49_CR6","unstructured":"Ehrich, H.-D. & V. Lohberger, Parametric specification of abstract data types, parametric substitution, and graph replacements, Proc. of workshop on \"Graphentheoretische Konzepte in der Informatik\", ed. \u2014 J. M\u00fchlbacher, Hanser-Verl., M\u00fcnchen, 1977."},{"key":"49_CR7","unstructured":"Freyd, P., Abelian Categories, Harper and Row, 1964."},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Hennessy, M. & G. Plotkin, Full abstraction for a simple parallel programming language, MFCS '79, LNCS 74, 1979.","DOI":"10.1007\/3-540-09526-8_8"},{"key":"49_CR9","unstructured":"Herrlich, H. & D. Strecker, Category Theory, Allyn and Bacon, 1978."},{"key":"49_CR10","unstructured":"Kahn, G. & G. Plotkin, Domaines concrets, Rapport No. 336, IRIA Laboria, 1978."},{"key":"49_CR11","unstructured":"Kanda, A., Thesis, University of Warwick, 1979."},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Kanda, A., Fully effective solutions of recursive domain equations, MFCS '79, LNCS 74, 1979.","DOI":"10.1007\/3-540-09526-8_30"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Kanda, A. & D. Park, When are two effectively given domains identical?, Proc. 4th GI Conf. in T.C.S., Aachen, LNCS 67, 1979.","DOI":"10.1007\/3-540-09118-1_19"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Lehmann, D., Categories for fixpoint semantics, Theory of Computation Report No. 15, University of Warwick, 1976.","DOI":"10.1109\/SFCS.1976.9"},{"key":"49_CR15","unstructured":"Lehmann, D., On the algebra of order, Mathematics Institute, Hebrew University, Jerusalem."},{"key":"49_CR16","unstructured":"Lehmann, D. & M. Smyth, The algebraic specification of data types; a synthetic approach, Report No. 119, Dept. of Computer Studies, University of Leeds, 1978 (also to appear in Math. Syst. Theory)."},{"key":"49_CR17","unstructured":"Martin L\u00f6f, P., Constructive mathematics and computer programming, 6th Int. Congress for Logic, Methodology and Phil. of Science, Hannover, 1979."},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Myhill, J. & J. Shepherdson, Effective operations on partial recursive functions, Zeitschr. f. math. Logik u. Grundl. d. Math., 1956.","DOI":"10.1002\/malq.19550010407"},{"key":"49_CR19","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. Plotkin","year":"1976","unstructured":"Plotkin, G., A power-domain construction, SIAM J. Comput. 5 (1976), 452\u2013487.","journal-title":"SIAM J. Comput."},{"key":"49_CR20","unstructured":"Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967."},{"key":"49_CR21","unstructured":"Scott, D., Continuous lattices, Lecture Notes in Math. 274, Springer, 1974."},{"key":"49_CR22","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"Scott, D., Data types as lattices, SIAM J. Comput. 5 (1976), 522\u2013587.","journal-title":"SIAM J. Comput."},{"key":"49_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","volume":"5","author":"M. Smyth","year":"1977","unstructured":"Smyth, M., Effectively given domains, Theor. Comp. Sci. 5 (1977), 257\u2013274.","journal-title":"Theor. Comp. Sci."},{"key":"49_CR24","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M. Smyth","year":"1978","unstructured":"Smyth, M., Power Domains, J. Comp. Syst. Sci. 16, (1978), 23\u201326.","journal-title":"J. Comp. Syst. Sci."},{"key":"49_CR25","unstructured":"Smyth, M., D. Phil Thesis, University of Oxford, 1978."},{"key":"49_CR26","doi-asserted-by":"crossref","unstructured":"Smyth, M. & G. Plotkin, Category-theoretic solution of recursive domain equations, D.A.I. Report 60, University of Edinburgh, 1978.","DOI":"10.1109\/SFCS.1977.30"},{"key":"49_CR27","doi-asserted-by":"crossref","unstructured":"Smyth, M., Computability in Categories, Theory of Computation Report, University of Warwick, 1979.","DOI":"10.1007\/3-540-10003-2_102"},{"key":"49_CR28","unstructured":"Tang, A., Recursion theory and descriptive set theory in effectively given T0 spaces, Ph.D. Thesis, Princeton University (1974)."},{"key":"49_CR29","unstructured":"Bergstra, J. & J. Tucker, Algebraic specifications of computable and semi-computable data structures, Dept. of Computer Science Report 1W115, Math. Cent., Amsterdam, 1979."},{"key":"49_CR30","unstructured":"Wand, M., Fixed-point constructions in order-enriched categories, TR 23, Computer Science Dept., Indiana University, 1975."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_102.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:02:13Z","timestamp":1605625333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}