{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:26:15Z","timestamp":1648934775598},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf03037340","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T02:55:31Z","timestamp":1240368931000},"page":"161-182","source":"Crossref","is-referenced-by-count":1,"title":["Bounded quantifications for iteration and concurrency in logic programming"],"prefix":"10.1007","volume":"12","author":[{"given":"Jonas","family":"Barklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037340_CR1","volume-title":"Proc. SIGPLAN '90 Conference on Programming Language Design and Implementation","author":"S. Anderson","year":"1990","unstructured":"Anderson, S. and Hudak, P., \u201cCompilation of Haskell Array Comprehensions for Scientific Computing,\u201d inProc. SIGPLAN '90 Conference on Programming Language Design and Implementation, ACM Press, New York, N. Y., 1990."},{"key":"BF03037340_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/163114.163129","volume":"28","author":"H. Arro","year":"1993","unstructured":"Arro, H., Barklund, J. and Bevemyr, J., \u201cParallel Bounded Quantification\u2014Preliminary Results,\u201d ACM SIGPLAN Notices, 28, pp. 117\u2013124, 1993.","journal-title":"ACM SIGPLAN Notices"},{"key":"BF03037340_CR3","volume-title":"Proc. 4th International Conference on Logic Programming and Automated Reasoning","author":"J. Barklund","year":"1993","unstructured":"Barklund, J. and Bevemyr, J., \u201cProlog with Arrays and Bounded Quantifications,\u201d inProc. 4th International Conference on Logic Programming and Automated Reasoning (A. Voronkov, ed.), Springer-Verlag, Berlin, 1993."},{"key":"BF03037340_CR4","volume-title":"Proc. 4th International Symposium on Programming Language Implementation and Logic Programming","author":"J. Barklund","year":"1993","unstructured":"Barklund, J. and Bevemyr, J., \u201cExecuting Bounded Quantifications on Shared Memory Multiprocessors,\u201d inProc. 4th International Symposium on Programming Language Implementation and Logic Programming (J. Penjaam, ed.), Springer-Verlag, Berlin, 1993."},{"key":"BF03037340_CR5","unstructured":"Barklund, J. and Millroth, H., \u201cNova Prolog,\u201dUPMAIL Technical Report, 52, Computing Science Department Uppsala University, 1988."},{"key":"BF03037340_CR6","first-page":"817","volume-title":"Proc. International Conference on Fifth Generation Computer Systems 1992","author":"J. Barklund","year":"1992","unstructured":"Barklund, J. and Millroth, H., \u201cProviding Iteration and Concurrency in Logic Programs through Bounded Quantifications\u201d, inProc. International Conference on Fifth Generation Computer Systems 1992 (H. Tanaka, ed.), Ohmsha, Tokyo, pp. 817\u2013824, 1992."},{"key":"BF03037340_CR7","unstructured":"Bevemyr, J., \u201cA Recursion Parallel Prolog Engine,\u201dPh.L. thesis, Computing Science Department, Uppsala University, 1993."},{"key":"BF03037340_CR8","unstructured":"Blanck, J., \u201cAbstrakt maskin f\u00f6r Nova Prolog,\u201dInternal Report in Swedish, Computing Science Department, Uppsala University, 1991."},{"key":"BF03037340_CR9","first-page":"3","volume-title":"Proc. 6th International Conference on Logic Programming","author":"M. Carlsson","year":"1989","unstructured":"Carlsson, M., \u201cOn the Efficiency of Optimising Shallow Backtracking in Compiled Prolog,\u201d inProc. 6th International Conference on Logic Programming (G. Levi and M. Martelli, ed.), MIT Press, Cambridge, Mass., pp. 3\u201316, 1989."},{"key":"BF03037340_CR10","series-title":"Groupe de Recherche en Intelligence Artificielle","volume-title":"Un Syst\u00e8me de Communication Homme-Machine en Fran\u00e7ais","author":"A. Colmerauer","year":"1972","unstructured":"Colmerauer, A., Kanoui, H., Pasero, R. and Roussel, P., \u201cUn Syst\u00e8me de Communication Homme-Machine en Fran\u00e7ais,\u201dGroupe de Recherche en Intelligence Artificielle, Univ. d'Aix-Marseille, Luminy, 1972."},{"key":"BF03037340_CR11","volume-title":"The AND\/OR Process Model for Parallel Interpretation of Logic Programs","author":"J. S. Conery","year":"1983","unstructured":"Conery, J. S., \u201cThe AND\/OR Process Model for Parallel Interpretation of Logic Programs,\u201dPh. D. thesis, University of California, Irvine, 1983."},{"key":"BF03037340_CR12","series-title":"Report","volume-title":"Parallel Programming Using Skeleton Functions","author":"J. Darlington","year":"1992","unstructured":"Darlington, J., Field, A. J., Harrison, P. G., Kelly, P. H. J., While, R. L. and Wu, Q., \u201cParallel Programming Using Skeleton Functions,\u201dReport, Department of Computing, Imperial College, London, 1992."},{"key":"BF03037340_CR13","first-page":"471","volume-title":"Proc. International Conference on Fifth Generation Computer Systems 1984","author":"D. DeGroot","year":"1984","unstructured":"DeGroot, D., \u201cRestricted And-Parallelism,\u201d inProc. International Conference on Fifth Generation Computer Systems 1984 (H. Aiso, ed.), North-Holland, Amsterdam, pp. 471\u2013478, 1984."},{"key":"BF03037340_CR14","first-page":"111","volume-title":"Proc. International Conference on Logic Programming 1991","author":"A. Dovier","year":"1991","unstructured":"Dovier, A., Omodeo, E. G., Pontelli, E. and Rossi, G., \u201c{log}: A Logic Programming Language with Finite Sets,\u201d inProc. International Conference on Logic Programming 1991 (K. Furukawa, ed.), MIT Press, Cambridge, Mass., pp. 111\u2013124, 1991."},{"key":"BF03037340_CR15","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/4472.4478","volume":"2","author":"R. Halstead","year":"1985","unstructured":"Halstead, R., \u201cMultilisp\u2014A Language for Concurrent Symbolic Computation,\u201dACM TOPLAS, 2, pp. 501\u2013538, 1985.","journal-title":"ACM TOPLAS"},{"key":"BF03037340_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-16492-8_62","volume-title":"Proc. 3rd International Conference on Logic Programming","author":"M. V. Hermenegildo","year":"1986","unstructured":"Hermenegildo, M. V., \u201cAn Abstract Machine for Restricted AND-Parallel Execution of Logic Programs,\u201d inProc. 3rd International Conference on Logic Programming (E. Shapiro, ed.), Springer-Verlag, Berlin, pp. 25\u201339, 1986."},{"key":"BF03037340_CR17","first-page":"253","volume-title":"Proc. 7th International Conference on Logic Programming","author":"M. V. Hermenegildo","year":"1990","unstructured":"Hermenegildo, M. V. and Greene, K. J., \u201c&-Prolog and Its Performance: Exploiting Independent And-Parallelism,\u201d inProc. 7th International Conference on Logic Programming (D. H. D. Warren and P. Szeredi, ed.), MIT Press, Cambridge, Mass., pp. 253\u2013268, 1990."},{"key":"BF03037340_CR18","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-16492-8_63","volume-title":"Proc. 3rd International Conference on Logic Programming","author":"M. V. Hermenegildo","year":"1986","unstructured":"Hermenegildo, M. V. and Nasr, R. I., \u201cEfficient Management of Backtracking in AND-Parallelism,\u201d inProc. 3rd International Conference on Logic Programming (E. Shapiro, ed.), Springer-Verlag, Berlin, pp. 40\u201354, 1986."},{"key":"BF03037340_CR19","first-page":"237","volume-title":"Proc. 7th International Conference on Logic Programming","author":"M. V. Hermenegildo","year":"1990","unstructured":"Hermenegildo, M. V. and Rossi, F., \u201cNon-Strict Independent And-Parallelism,\u201d inProc. 7th International Conference on Logic Programming (D. H. D. Warren and P. Szeredi, ed.), MIT Press, Cambridge, Mass., pp. 237\u2013252, 1990."},{"key":"BF03037340_CR20","volume-title":"The G\u00f6del Programming Language","author":"P. M. Hill","year":"1994","unstructured":"Hill, P. M. and Lloyd, J. W.,The G\u00f6del Programming Language, MIT Press, Cambridge, Mass., 1994."},{"key":"BF03037340_CR21","doi-asserted-by":"crossref","unstructured":"Hudak, P., Peyton Jones, S. and Wadler, P. (eds.), \u201cReport on the Programming Language Haskell\u201d,ACM SIGPLAN Notices, 27, 5, 1992.","DOI":"10.1145\/130697.130699"},{"key":"BF03037340_CR22","unstructured":"Jouret, G. K., \u201cCompiling Functional Languages for SIMD Architectures,\u201d inProc. 3rd IEEE Symposium on Parallel and Distributed Languages, 1991."},{"key":"BF03037340_CR23","unstructured":"Knuth, D. E.,The Art of Computer Programming, Vol. 1\/Fundamental Algorithms, Reading, Mass., 1968."},{"key":"BF03037340_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"Lloyd, J. W.,Foundations of Logic Programming, Second Edition, Springer-Verlag, Berlin, 1987.","edition":"Second Edition"},{"key":"BF03037340_CR25","doi-asserted-by":"crossref","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., \u201cMaking Prolog More Expressive,\u201dJ. Logic Programming, 1, pp. 225\u2013240, 1984.","journal-title":"J. Logic Programming"},{"key":"BF03037340_CR26","first-page":"157","volume-title":"Proc. 8th International Conference on Logic Programming","author":"M. Meier","year":"1991","unstructured":"Meier, M., \u201cRecursion vs. Iteration in Prolog,\u201d inProc. 8th International Conference on Logic Programming (K. Furukawa, ed.), MIT Press, Cambridge, Mass., pp. 157\u2013169, 1991."},{"key":"BF03037340_CR27","volume-title":"Fortran 90 Explained","author":"M. Metcalf","year":"1990","unstructured":"Metcalf, M. and Reid, J.,Fortran 90 Explained, Oxford University Press, Oxford, 1990."},{"key":"BF03037340_CR28","unstructured":"Millroth, H., \u201cReforming Compilation of Logic Programs,\u201dPh.D. thesis, Uppsala Theses in Computing Science 10, Computing Science Department, Uppsala University, 1990."},{"key":"BF03037340_CR29","volume-title":"Numerical Recipes, The Art of Scientific Computing","author":"W. H. Press","year":"1989","unstructured":"Press, W. H.et al., Numerical Recipes, The Art of Scientific Computing, Cambridge University Press, Cambridge, U. K., 1989."},{"key":"BF03037340_CR30","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., \u201cFirst Order Compiler: A Deterministic Logic Program Synthesis Algorithm,\u201dJ. Symbolic Computation, 8, pp. 605\u2013627, 1989.","journal-title":"J. Symbolic Computation"},{"key":"BF03037340_CR31","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":"BF03037340_CR32","series-title":"ICOT Technical Report, TR-003","volume-title":"A Subset of Concurrent Prolog and Its Interpreter","author":"E. Shapiro","year":"1983","unstructured":"Shapiro, E., \u201cA Subset of Concurrent Prolog and Its Interpreter,\u201dICOT Technical Report, TR-003, ICOT, Tokyo, 1983."},{"key":"BF03037340_CR33","unstructured":"T\u00e4rnlund, S.-\u00c5., \u201cReform,\u201dunpublished manuscript, 1992."},{"key":"BF03037340_CR34","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90233-X","volume":"25","author":"R. D. Tennent","year":"1987","unstructured":"Tennent, R. D., \u201cQuantification in Algol-Like Languages,\u201dInformation Processing Letters, 25, pp. 133\u2013137, 1987.","journal-title":"Information Processing Letters"},{"key":"BF03037340_CR35","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":"BF03037340_CR36","series-title":"ICOT Technical Report, TR-208","volume-title":"Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard","author":"K. Ueda","year":"1986","unstructured":"Ueda, K., \u201cGuarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard,\u201dICOT Technical Report, TR-208, ICOT, Tokyo, 1986."},{"key":"BF03037340_CR37","first-page":"486","volume-title":"Logic Programming\u2014Proc. Second Russian Conference on Logic Programming","author":"A. Voronkov","year":"1992","unstructured":"Voronkov, A., \u201cLogic Programming with Bounded Quantifiers,\u201d inLogic Programming\u2014Proc. Second Russian Conference on Logic Programming (A. Voronkov, ed.), Springer-Verlag, Berlin, pp. 486\u2013514, 1992."},{"key":"BF03037340_CR38","series-title":"Technical Report, ECRC-92-29","volume-title":"Logic Programming with Bounded Quantifiers","author":"A. Voronkov","year":"1992","unstructured":"Voronkov, A., \u201cLogic Programming with Bounded Quantifiers,\u201dTechnical Report, ECRC-92-29, ECRC, Munich, 1992."},{"key":"BF03037340_CR39","series-title":"SRI Technical Note","volume-title":"An Abstract Prolog Instruction Set","author":"D. H. D. Warren","year":"1983","unstructured":"Warren, D. H. D., \u201cAn Abstract Prolog Instruction Set,\u201dSRI Technical Note, 309, SRI International, Menlo Park, Calif., 1983."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037340.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037340\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:34Z","timestamp":1558572754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF03037340"],"URL":"https:\/\/doi.org\/10.1007\/bf03037340","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}