{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:50Z","timestamp":1725662990307},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095262"},{"type":"electronic","value":"9783540350880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09526-8_30","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:47:26Z","timestamp":1330188446000},"page":"326-336","source":"Crossref","is-referenced-by-count":13,"title":["Fully effective solutions of recursive domain equations"],"prefix":"10.1007","author":[{"given":"Akira","family":"Kanda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"30_CR1","unstructured":"Kanda, A, Data types as effective object, Theory of Computation Report No. 22, Warwick University, (1977)."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Kanda-Park, When two effectively given domains are identical, Proc. of the 4th GI Theoretical Computer Science Conference, Lecture Notes in Computer Science No. 67, (1979).","DOI":"10.1007\/3-540-09118-1_19"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Lehmann-Smyth, Data Types, Proc. of the 18th IEEE FOCS Conference, (1977).","DOI":"10.1109\/SFCS.1977.10"},{"key":"30_CR4","unstructured":"Scott-Strachey, Towards a mathematical semantics of computer languages, Proc. of Symposium on Computer and Automata, Polytechnical Inst. of Brooklyn (1971)."},{"key":"30_CR5","unstructured":"Scott D., Data types as lattices, Unpublished lecture notes, Amsterdam, (1972)."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Scott D., Data types as lattices, SIAM J. on Computing, Vol. 5, (1976).","DOI":"10.1137\/0205037"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Smyth-Plotkin, The categorical solution of recursive domain equations, Proc. of the 18th IEEE FOCS Conference, (1977).","DOI":"10.1109\/SFCS.1977.30"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Tennent R., The denotational semantics of programming languages, CACM, Vol. 19, No. 18, (1977).","DOI":"10.1145\/360303.360308"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Egli-Constable, Computability concepts for programming language semantics, Theoretical Computer Science, Vol. 2, (1976).","DOI":"10.1016\/0304-3975(76)90029-3"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Rosen-Markowsky, Bases for chain complete posets, IBM J. of R&D, Vol. 5, No. 3, (1976).","DOI":"10.1147\/rd.202.0138"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Smyth M., Effectively given domains, Theoretical Computer Science, Vol. 5, (1977).","DOI":"10.1016\/0304-3975(77)90045-7"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1979"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09526-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:59:33Z","timestamp":1640912373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09526-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095262","9783540350880"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-09526-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}