{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:06:14Z","timestamp":1747548374068},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540502418"},{"type":"electronic","value":"9783540459606"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50241-6_29","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:18:50Z","timestamp":1330201130000},"page":"56-63","source":"Crossref","is-referenced-by-count":2,"title":["Is setl a suitable language for parallel programming \u2014 a theoretical approach"],"prefix":"10.1007","author":[{"given":"Elias","family":"Dahlhaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets and Structures","author":"J. Barwise","year":"1975","unstructured":"J. Barwise, Admissible Sets and Structures, Springer, Berlin 1975"},{"issue":"2","key":"5_CR2","first-page":"156","volume":"21","author":"A. Chandra","year":"1980","unstructured":"A. Chandra, D. Harel, Computable Queries of Relational Data Bases, JCSS 21.2 (1980), p. 156\u2013178.","journal-title":"JCSS"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. Cook","year":"1985","unstructured":"S. Cook, A Taxonomy of Problems with Fast Parallel Algorithms, Information and Control 64 (1985), pp. 2\u201322.","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"E. Dahlhaus, J. Makowsky, Computable Directory Queries, CAAP 86, LNCS 214, pp. 254\u2013265.","key":"5_CR4","DOI":"10.1007\/BFb0022673"},{"doi-asserted-by":"crossref","unstructured":"E. Dahlhaus, J. Makowsky, The Choice of Programming Primitives in SETL-Like Languages, ESOP 86, LNCS 213, pp. 160\u2013172.","key":"5_CR5","DOI":"10.1007\/3-540-16442-1_12"},{"unstructured":"E. Dahlhaus, J. Makowsky, Gandy's Principles of Mechanism as a Model of Parallel Computation, to appear in \"The Universal Turing Machine, a Half Century Survey\", R. Herken ed., Kammerer und Unverzagt, Hamburg.","key":"5_CR6"},{"doi-asserted-by":"crossref","unstructured":"R. Gandy,Church's Thesis and Principles of Mechanism, in \"The Kleene-Symposium\", J. Barwise et al. ed, North Holland, Amsterdam 1980, pp. 123\u2013148.","key":"5_CR7","DOI":"10.1016\/S0049-237X(08)71257-6"},{"issue":"2","key":"5_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","volume":"9","author":"L. Goldschlager","year":"1977","unstructured":"L. Goldschlager, The Monctone and Planar Circuit Value Problems are Logspace Complete for P, SIGACT News 9,2 (1977), pp. 25\u201329.","journal-title":"SIGACT News"},{"key":"5_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09507-2","volume-title":"Fundamentals of Programming Languages","author":"E. Horowitz","year":"1983","unstructured":"E. Horowitz, Fundamentals of Programming Languages, Computer Science Press, Rockville 1983."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BFb0099491","volume-title":"Computation and Proof Theory","author":"Y. Moschovakis","year":"1984","unstructured":"Y. Moschovakis, Abstract Recursion as a Foundation for the Theory of Algorithms, \"Computation and Proof Theory\", M. Richter et al. ed., LNM 1104, Springer, Berlin 1984, pp. 289\u2013362."},{"doi-asserted-by":"crossref","unstructured":"D. Norman, Set Recursion, in \"Generalized Recursion Theory\", J. Fensted et al. ed., North Holland, Amsterdam 1978, 303\u2013320.","key":"5_CR11","DOI":"10.1016\/S0049-237X(08)70938-8"},{"unstructured":"D. R\u00f6dding, Theorie der Rekusivit\u00e4t \u00fcber dem Bereich der endlichen Mengen von endlichem Rang, Habilitationsschrift, Universit\u00e4t M\u00fcnster 1964.","key":"5_CR12"},{"key":"5_CR13","volume-title":"On Programming: An Interim Report on the SETL-Project","author":"J. Schwartz","year":"1975","unstructured":"J. Schwartz, On Programming: An Interim Report on the SETL-Project, 2nd Edition, Courant Institute of Mathematics, New York 1975.","edition":"2nd Edition"}],"container-title":["Lecture Notes in Computer Science","CSL '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50241-6_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:17:41Z","timestamp":1605647861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50241-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540502418","9783540459606"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-50241-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}