{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:53Z","timestamp":1725662933231},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108566"},{"type":"electronic","value":"9783540387695"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10856-4_125","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:41:24Z","timestamp":1330202484000},"page":"563-577","source":"Crossref","is-referenced-by-count":4,"title":["Constructive category theory (No. 1)"],"prefix":"10.1007","author":[{"given":"Akira","family":"Kanda","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"56_CR1","unstructured":"Kanda, A., Data types as effective objects, Theory of Computation Report, No. 22, Warwick Univ. (1977)."},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Kanda, A., Fully effective solutions of recursive domain equations, Proc. of the M.F.C.S. '79. Lecture Note in Computer Science, No. 74 (1979).","DOI":"10.1007\/3-540-09526-8_30"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Kanda, A., Effective Solutions of Recursive Domain Equations, Ph.D. Thesis, Warwick Univ. (1980).","DOI":"10.1007\/3-540-09526-8_30"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Kanda & Park, When are two effectively given domains identical? Proc. of the 4th GT. Theoretical Computer Science Symposium, Lecture Note in Computer Science, No. 67 (1979).","DOI":"10.1007\/3-540-09118-1_19"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Plotkin & Smyth, The categorical solution of recursive domain equations, Proc. of the 18th FOCS Conference (1977).","DOI":"10.1109\/SFCS.1977.30"},{"key":"56_CR6","unstructured":"Scott, D., Some philosophical issues concenrning Theories of combinators. Proc. of the Conference on \u03bb-calculus and Computer Science theory. LNCS No. 37."},{"key":"56_CR7","unstructured":"Scott, D., A Space of Retracts, Lecture Note, Bremen, Nov. (1979)."},{"key":"56_CR8","volume-title":"A basis for a mathematical theory of computation, Computer Programming and formal systems","author":"J. McCarthy","year":"1963","unstructured":"McCarthy, J., A basis for a mathematical theory of computation, Computer Programming and formal systems, North-Holland, Amsterdam (1963)."},{"key":"56_CR9","unstructured":"Scott, D, Data types as lattices, Lecture Note, Amsterdam, (1972)."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1981"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10856-4_125.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T14:14:04Z","timestamp":1687270444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10856-4_125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108566","9783540387695"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-10856-4_125","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}