{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:39Z","timestamp":1779836739248,"version":"3.53.1"},"reference-count":37,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    As a means of transmitting not only data but also code encapsulated within functions, higher-order channels provide an advanced form of task parallelism in parallel computations. In the presence of mutable references, however, they pose a safety problem because references may be transmitted to remote threads where they are no longer valid. This paper presents an ML-like parallel language with\n                    <jats:italic>type-safe<\/jats:italic>\n                    higher-order channels. By type safety, we mean that no value written to a channel contains references, or equivalently, that no reference escapes via a channel from the thread where it is created. The type system uses a typing judgment that is capable of deciding whether the value to which a term evaluates contains references or not. The use of such a typing judgment also makes it easy to achieve another desirable feature of channels,\n                    <jats:italic>channel locality<\/jats:italic>\n                    , that associates every channel with a unique thread for serving all values addressed to it. Our type system permits mutable references in sequential computations and also ensures that mutable references never interfere with parallel computations. Thus, it provides both flexibility in sequential programming and ease of implementing parallel computations.\n                  <\/jats:p>","DOI":"10.1017\/s0956796808006989","type":"journal-article","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:17:23Z","timestamp":1220937443000},"page":"107-142","source":"Crossref","is-referenced-by-count":0,"title":["Type-safe higher-order channels with channel locality"],"prefix":"10.1017","volume":"19","author":[{"given":"SUNGWOO","family":"PARK","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"HYEONSEUNG","family":"IM","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2009,1,1]]},"reference":[{"key":"S0956796808006989_ref17","volume-title":"Titanium Language Reference Manual, Version 2.19.","author":"Hilfinger","year":"2005"},{"key":"S0956796808006989_ref10","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/1094811.1094852","volume-title":"Proceedings of the 20th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications.","author":"Charles","year":"2005"},{"key":"S0956796808006989_ref5","doi-asserted-by":"publisher","DOI":"10.1145\/872734.806932"},{"key":"S0956796808006989_ref2","first-page":"374","volume-title":"Proceedings of the Second International Conference on Coordination Languages and Models, LNCS 1282.","author":"Amadio","year":"1997"},{"key":"S0956796808006989_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258967"},{"key":"S0956796808006989_ref27","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129501003322"},{"key":"S0956796808006989_ref9","first-page":"11","volume-title":"Proceedings of the ACM SIGPLAN Workshop on Declarative Aspects of Multicore Programming.","author":"Chakravarty","year":"2007"},{"key":"S0956796808006989_ref7","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/43.4.274"},{"key":"S0956796808006989_ref14","first-page":"406","volume-title":"CONCUR: Seventh International Conference on Concurrency Theory, LNCS 1119.","author":"Fournet","year":"1996"},{"key":"S0956796808006989_ref23","volume-title":"Implicit Parallel Programming in pH.","author":"Nikhil","year":"2001"},{"key":"S0956796808006989_ref36","first-page":"557","volume-title":"CONCUR: 10th International Conference on Concurrency Theory, LNCS 1664.","author":"Yoshida","year":"1999"},{"key":"S0956796808006989_ref12","unstructured":"El-Ghazawi Tarek , Carlson William & Draper Jesse (2003) UPC Language Specifications, v1.1.1"},{"key":"S0956796808006989_ref13","first-page":"25","volume-title":"Proceedings of the ACM SIGPLAN Workshop on Declarative Aspects of Multicore Programming.","author":"Fluet","year":"2007"},{"key":"S0956796808006989_ref34","doi-asserted-by":"publisher","DOI":"10.1145\/88616.88631"},{"key":"S0956796808006989_ref33","unstructured":"Simpson Alex K. (1994) The Proof Theory and Semantics of Intuitionistic Modal Logic. Ph.D. Thesis, Department of Philosophy, University of Edinburgh."},{"key":"S0956796808006989_ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1993.287570"},{"key":"S0956796808006989_ref31","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/604131.604136","volume-title":"Proceedings of the 30th ACM SIGPLAN\u2013SIGACT Symposium on Principles of Programming Languages.","author":"Schmitt","year":"2003"},{"key":"S0956796808006989_ref29","first-page":"79","volume-title":"Trends in Functional Programming","author":"Rossberg","year":"2005"},{"key":"S0956796808006989_ref8","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/14.3.329"},{"key":"S0956796808006989_ref11","unstructured":"Cray Inc. (2005) The Chapel Language Specification Version 0.4. Technical Report."},{"key":"S0956796808006989_ref15","first-page":"129","volume-title":"Advanced Functional Programming, Fourth International School, 2002, LNCS 2638","author":"Fournet","year":"2003"},{"key":"S0956796808006989_ref1","unstructured":"Allan Eric , Chase David , Hallet Joe , Luchangco Victor , Maessen Jan-Willem , Ryu Sukyoung , Steele Guy L. Jr. & Tobin-Hochstadt Sam (2007) The Fortress Language Specification Version 1.0Beta. Technical Report, Sun Microsystems Inc."},{"key":"S0956796808006989_ref32","first-page":"204","volume-title":"Proceedings of the 14th ACM Symposium on Principles of Distributed Computing.","author":"Shavit","year":"1995"},{"key":"S0956796808006989_ref20","unstructured":"Knabe Frederick (1995) Language Support for Mobile Agents. Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University."},{"key":"S0956796808006989_ref21","volume-title":"Trustworthy Global Computing 2007.","author":"Murphy","year":"2007"},{"key":"S0956796808006989_ref22","first-page":"286","volume-title":"Proceedings of the 19th IEEE Symposium on Logic in Computer Science.","author":"Murphy","year":"2004"},{"key":"S0956796808006989_ref19","volume-title":"Proceedings of the European Symposium on Programming, LNCS 2986.","author":"Jia","year":"2004"},{"key":"S0956796808006989_ref24","first-page":"324","volume-title":"Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1026.","author":"Odersky","year":"1995"},{"key":"S0956796808006989_ref6","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"S0956796808006989_ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.53"},{"key":"S0956796808006989_ref25","first-page":"217","volume-title":"Proceedings of the Fourth Asian Symposium on Programming Languages and Systems, LNCS 4279","author":"Park","year":"2006"},{"key":"S0956796808006989_ref26","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/1291151.1291181","volume-title":"Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming.","author":"Park","year":"2007"},{"key":"S0956796808006989_ref16","doi-asserted-by":"publisher","DOI":"10.1145\/4472.4478"},{"key":"S0956796808006989_ref30","first-page":"563","volume-title":"TCS '02: Proceedings of the IFIP 17th World Computer Congress\u2014TC1 Stream\/Second IFIP","author":"Schmitt","year":"2002"},{"key":"S0956796808006989_ref35","article-title":"The free lunch is over: A fundamental turn toward concurrency in software","volume":"30","author":"Sutter","year":"2005","journal-title":"Dr. Dobb's J."},{"key":"S0956796808006989_ref37","first-page":"601","volume-title":"Proceedings of the Second IFIP International Conference on Theoretical Computer Science.","author":"Zhang","year":"2002"},{"key":"S0956796808006989_ref4","unstructured":"Asanovic Krste , Bodik Ras , Catanzaro Bryan Christopher , Gebis Joseph , Husbands Parry , Keutzer Kurt , Patterson David , Plishker William , Shalf John , Williams Samuel & Yelick Katherine (December 2006). The Landscape of Parallel Computing Research: A View From Berkeley. Technical Report No. UCB\/EECS-2006-183, EECS Department, University of California, Berkeley."}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796808006989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:36:12Z","timestamp":1779834972000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796808006989\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["S0956796808006989"],"URL":"https:\/\/doi.org\/10.1017\/s0956796808006989","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}