{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:38Z","timestamp":1725663638350},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569442"},{"type":"electronic","value":"9783540478300"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56944-8_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:58:09Z","timestamp":1330257489000},"page":"28-39","source":"Crossref","is-referenced-by-count":5,"title":["Prolog with arrays and bounded quantifications"],"prefix":"10.1007","author":[{"given":"Jonas","family":"Barklund","sequence":"first","affiliation":[]},{"given":"Johan","family":"Bevemyr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"3_CR1","volume-title":"Compilation of Haskell Array Comprehensions for Scientific Computing","author":"S. Anderson","year":"1990","unstructured":"Anderson, S. and Hudak, P., Compilation of Haskell Array Comprehensions for Scientific Computing, in: Proc. SIGPLAN '90 Conf. on Programming Language Design and Implementation, ACM Press, New York, N.Y., 1990."},{"key":"3_CR2","volume-title":"UPMAIL Tech. Rep. 74","author":"H. Arro","year":"1993","unstructured":"Arro, H., Barklund, J. and Bevemyr, J., Parallel Bounded Quantifications\u2014 Preliminary Results, UPMAIL Tech. Rep. 74, Comp. Sci. Dept., Uppsala Univ., Uppsala, 1993, to appear in SIGPLAN Notices."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Barklund, J. and Bevemyr, J., Executing Bounded Quantifications on Shared Memory Multiprocessors, submitted to PLILP'93, 1993.","DOI":"10.1007\/3-540-57186-8_87"},{"key":"3_CR4","volume-title":"UPMAIL Tech. Rep. 77","author":"J. Barklund","year":"1993","unstructured":"Barklund, J. and Bevemyr, J., Prolog with Arrays and Bounded Quantifications, UPMAIL Tech. Rep. 77, Comp. Sci. Dept., Uppsala Univ., Uppsala, 1993."},{"key":"3_CR5","volume-title":"Integrating Complex Data Structures in Prolog","author":"J. Barklund","year":"1987","unstructured":"Barklund, J. and Millroth, H., Integrating Complex Data Structures in Prolog, in: S. Haridi (ed.), Proc. 1987 Symp. on Logic Programming, Comp. Soc. Press of the IEEE, Washington, D.C., 1987."},{"key":"3_CR6","unstructured":"Barklund, J. and Millroth, H., Providing Concurrency and Iteration in Logic Programming through Bounded Quantifications, in: H. Tanaka (ed.), Proc. Intl. Conf. on Fifth Generation Computer Systems 1992, Ohmsha, Tokyo, 1992."},{"key":"3_CR7","volume-title":"UPMAIL Tech. Rep. 72","author":"J. Bevemyr","year":"1992","unstructured":"Bevemyr, J., The Luther WAM Emulator, UPMAIL Tech. Rep. 72, Comp. Sci. Dept., Uppsala Univ., Uppsala, 1992."},{"key":"3_CR8","volume-title":"log: a Logic Programming Language with Finite Sets","author":"A. Dovier","year":"1991","unstructured":"Dovier, A., Omodeo, E. G., Pontelli, E. and Rossi, G., log: a Logic Programming Language with Finite Sets, in: K. Furukawa (ed.), Proc. Intl. Conf. on Logic Programming 1991, MIT Press, Cambridge, Mass., 1991."},{"key":"3_CR9","unstructured":"Eriksson, L.-H. and Rayner, M., Incorporating Mutable Arrays into Logic Programming, in: S.-\u00c5. T\u00e4rnlund (ed.), Proc. 2nd Intl. Logic Programming Conf., Uppsala University, 1984."},{"key":"3_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"D. Gries","year":"1981","unstructured":"Gries, D., The Science of Programming, Springer-Verlag, New York., 1981."},{"key":"3_CR11","volume-title":"Technical Report 91-02","author":"P. M. Hill","year":"1991","unstructured":"Hill, P. M. and Lloyd, J. W., The G\u00f6del Report, Technical Report 91-02, Comp. Sci. Dept., Univ. of Bristol, Bristol, 1991."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"J. W. Lloyd","year":"1984","unstructured":"Lloyd, J. W. and Topor, R. W., Making Prolog more Expressive, J. Logic Programming, 1:225\u2013240 (1984).","journal-title":"J. Logic Programming"},{"key":"3_CR13","volume-title":"Recursion vs. Iteration in Prolog","author":"M. Meier","year":"1991","unstructured":"Meier, M., Recursion vs. Iteration in Prolog, in: K. Furukawa (ed.), Logic Programming\u2014Proc. Eighth Intl. Conf., MIT Press, Cambridge, Mass., 1991."},{"key":"3_CR14","volume-title":"Fortran 90 Explained","author":"M. Metcalf","year":"1990","unstructured":"Metcalf, M. and Reid, J., Fortran 90 Explained, Oxford Univ. Press, Oxford, 1990."},{"key":"3_CR15","volume-title":"Ph.D. Thesis","author":"H. Millroth","year":"1990","unstructured":"Millroth, H., Reforming Compilation of Logic Programs, Ph.D. Thesis, Comp. Sci. Dept., Uppsala Univ., Uppsala, 1990."},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/S0747-7171(89)80064-1","volume":"8","author":"T. Sato","year":"1989","unstructured":"Sato, T. and Tamaki, H., First Order Compiler: a Deterministic Logic Program Synthesis Algorithm, J. Symbolic Computation, 8:605\u2013627 (1989).","journal-title":"J. Symbolic Computation"},{"key":"3_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9575-1","volume-title":"Programming with Sets: an Introduction to SETL","author":"J. T. Schwartz","year":"1986","unstructured":"Schwartz, J. T., Devar, R. B. K., Dubinski, E. and Schonberg, E., Programming with Sets: an Introduction to SETL, Springer-Verlag, Berlin, 1986."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(87)90233-X","volume":"25","author":"R. D. Tennent","year":"1987","unstructured":"Tennent, R. D., Quantification in Algol-like Languages, Information Processing Letters, 25:133\u2013137 (1987).","journal-title":"Information Processing Letters"},{"key":"3_CR19","volume-title":"Semantics of Programming Languages","author":"R. D. Tennent","year":"1991","unstructured":"Tennent, R. D., Semantics of Programming Languages, Prentice-Hall International, Hemel Hempstead, 1991."},{"key":"3_CR20","series-title":"LNCS 592","volume-title":"Logic Programming with Bounded Quantifiers","author":"A. Voronkov","year":"1992","unstructured":"Voronkov, A., Logic Programming with Bounded Quantifiers, in: A. Voronkov (ed.), Logic Programming\u2014Proc. Second Russian Conf. on Logic Programming, LNCS 592, Springer-Verlag, Berlin, 1992."},{"key":"3_CR21","volume-title":"Technical Report ECRC-92-29","author":"A. A. Voronkov","year":"1992","unstructured":"Voronkov, A. A., Logic Programming with Bounded Quantifiers, Technical Report ECRC-92-29, ECRC, Munich, 1992."},{"key":"3_CR22","volume-title":"SRI Tech. Note 309","author":"D. H. D. Warren","year":"1983","unstructured":"Warren, D. H. D., An Abstract Prolog Instruction Set, SRI Tech. Note 309, SRI Intl., Menlo Park, Calif., 1983."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56944-8_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:36Z","timestamp":1605647256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56944-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569442","9783540478300"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-56944-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}