{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T18:29:32Z","timestamp":1693852172740},"reference-count":36,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00229-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:57:26Z","timestamp":1027605446000},"page":"117-146","source":"Crossref","is-referenced-by-count":5,"title":["Continuation-based transformations for coordination languages"],"prefix":"10.1016","volume":"240","author":[{"given":"Suresh","family":"Jagannathan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(99)00229-7_BIB1","first-page":"54","article-title":"The Now Team","volume":"15","author":"Anderson","year":"1995","journal-title":"A case for NOW (Networks of Workstations) IEEE Micro"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB2","series-title":"Compiling with Continuations","author":"Appel","year":"1992"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB3","first-page":"301","article-title":"A standard ML compiler","volume":"Vol. 274","author":"Appel","year":"1987"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB4","doi-asserted-by":"crossref","unstructured":"G. Boudol, The \u03c0-calculus in direct-style, in: 24th ACM Symp. on Principles of Programming Languages, 1997, pp. 228\u2013241.","DOI":"10.1145\/263699.263726"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB5","doi-asserted-by":"crossref","unstructured":"C. Bruggeman, O. Waddell, K. Dybvig, Representing control in the presence of one-shot continuations, in ACM Conf. on Programming Language Design and Implementation, June 1996.","DOI":"10.1145\/231379.231395"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB6","series-title":"Proc. 22nd ACM Symp. on Principles of Programming Languages","first-page":"286","article-title":"A language with distributed scope","author":"Cardelli","year":"1995"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB7","first-page":"140","article-title":"Mobile ambients","volume":"Vol. 1378","author":"Cardelli","year":"1998"},{"issue":"4","key":"10.1016\/S0304-3975(99)00229-7_BIB8","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/63334.63337","article-title":"Linda in context","volume":"32","author":"Carriero","year":"1989","journal-title":"Comm. ACM"},{"issue":"5","key":"10.1016\/S0304-3975(99)00229-7_BIB9","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1145\/213978.213986","article-title":"Higher-order distributed objects","volume":"17","author":"Cejtin","year":"1995","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB10","doi-asserted-by":"crossref","unstructured":"M. Felleisen, The theory and practice of first-class prompts, in: 15th ACM Symp. on Principles of Programming Languages, 1988, pp. 180\u2013190.","DOI":"10.1145\/73560.73576"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB11","series-title":"3rd Working Conf. on the Formal Description of Programming Concepts","first-page":"193","article-title":"Control Operators, the SECD-machine, and the Lambda-calculus","author":"Felleisen","year":"1986"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB12","doi-asserted-by":"crossref","unstructured":"M. Felleisen, D. Friedman, A calculus for assignments in higher-order languages, in: Proc. 14th ACM Symp. on Principles of Programming Languages, 1987, pp. 314\u2013325.","DOI":"10.1145\/41625.41654"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB13","doi-asserted-by":"crossref","unstructured":"C. Flanagan, M. Felleisen, The semantics of future and its use in program optimization, in: Proc. 12th ACM Symp. on Principles of Programming Languages, 1995, pp. 290\u2013220.","DOI":"10.1145\/199448.199484"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB14","doi-asserted-by":"crossref","unstructured":"C. Flanagan, A. Sabry, B. Duba, M. Felleisen, The essence of compiling with continuations, in: ACM Symp. on Programming Language Design and Implementation, 1993, pp. 237\u2013247.","DOI":"10.1145\/155090.155113"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB15","doi-asserted-by":"crossref","unstructured":"C. Fournet, G. Gonthier, A calculus of mobile agents, in: CONCUR\u201996: Concurrency Theory, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996, pp. 406\u2013421.","DOI":"10.1007\/3-540-61604-7_67"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB16","volume":"Vol. 1282","year":"1997"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB17","first-page":"20","article-title":"Multiple tuple spaces in Linda","volume":"Vol. 365","author":"Gelernter","year":"1989"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB18","doi-asserted-by":"crossref","unstructured":"D. Gelernter, D. Kaminsky, Supercomputing out of recycled garbage: preliminary experience with piranha, in: Proc. 6th ACM Internat. Conf. on Supercomputing, July 1992, pp. 417\u2013427.","DOI":"10.1145\/143369.143444"},{"issue":"4","key":"10.1016\/S0304-3975(99)00229-7_BIB19","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/4472.4478","article-title":"Multilisp: a language for concurrent symbolic computation","volume":"7","author":"Halstead","year":"1985","journal-title":"Trans. Programm. Languages Systems"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB20","doi-asserted-by":"crossref","unstructured":"R. Hieb, K. Dybvig, C. Bruggeman, Representing control in the presence of first-class continuations, in ACM Conf. on Programming Language Design and Implementation, June 1990.","DOI":"10.1145\/93542.93554"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB21","doi-asserted-by":"crossref","unstructured":"W. Hsieh, P. Wang, W. Weihl, Computation migration: enhancing locality for distributed-memory parallel systems, in The 4th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, ACM, New York, May 1993, pp. 239\u2013249.","DOI":"10.1145\/173284.155357"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB22","doi-asserted-by":"crossref","unstructured":"S. Jagannathan, S. Weeks, Analyzing stores and references in a parallel symbolic language, in: Proc. 1994 ACM Internat. Conf. on Lisp and Functional Programming, 1994, pp. 294\u2013305.","DOI":"10.1145\/182409.182493"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB23","doi-asserted-by":"crossref","unstructured":"R. Kelsey, P. Hudak, Realistic compilation by program transformation, in Proc. 16th ACM Symp. on Principles of Programming Languages, 1989, pp. 281\u2013292.","DOI":"10.1145\/75277.75302"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB24","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB25","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"2","author":"Milner","year":"1992","journal-title":"J. Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00229-7_BIB26","series-title":"Logic and Algebra of Specification","first-page":"203","article-title":"The polyadic \u03c0-calculus","author":"Milner","year":"1993"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB27","doi-asserted-by":"crossref","unstructured":"R. Mohr, D. Kranz, R. Halstead, Lazy task creation: a technique for increasing the granularity of parallel programs, in Proc. 1990 ACM Conf. on Lisp and Functional Programming, June 1990.","DOI":"10.1145\/91556.91631"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB28","first-page":"615","article-title":"Correctness of a distributed-memory model for scheme","volume":"Vol. 1123","author":"Moreau","year":"1996"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB29","doi-asserted-by":"crossref","unstructured":"L. Moreau, The semantics of scheme with future, in Proc. 1996 ACM Internat. Conf. on Functional Programming, 1996, pp. 146\u2013156.","DOI":"10.1145\/232627.232644"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB30","series-title":"Proc. 9th ACM Symp. on Operating Systems Principles","first-page":"110","article-title":"Process Migration in DEMOS\/MP","author":"Powell","year":"1983"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB31","first-page":"431","article-title":"A concurrent and distributed extension of scheme","volume":"Vol. 605","author":"Queinnec","year":"1992"},{"issue":"2","key":"10.1016\/S0304-3975(99)00229-7_BIB32","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/201059.201065","article-title":"Supporting dynamic data structures on distributed-memory machines","volume":"17","author":"Rogers","year":"1995","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB33","doi-asserted-by":"crossref","unstructured":"A. Sabry, M. Felleisen, Is continuation passing useful for data flow analysis? in ACM Symp. on Programming Language Design and Implementation, 1994, pp. 1\u201312.","DOI":"10.1145\/178243.178244"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB34","series-title":"A calculus with code mobility, in Formal Methods for Open Object-Oriented Distributed Systems","author":"Sekiguchi","year":"1997"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB35","doi-asserted-by":"crossref","unstructured":"Z. Shao, A. Appel, Space-efficient closure representations, in Proc. 1994 ACM Symp. on Lisp and Functional Programming, 1994, pp. 150\u2013161.","DOI":"10.1145\/182409.156783"},{"key":"10.1016\/S0304-3975(99)00229-7_BIB36","series-title":"Calculi for higher-order communicating processes, Ph.D. Thesis","author":"Thomsen","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:15:24Z","timestamp":1578518124000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002297"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00229-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}