{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:48Z","timestamp":1750221168240,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T00:00:00Z","timestamp":1504051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/L00058X\/1 and EP\/N028201\/1"],"award-info":[{"award-number":["EP\/L00058X\/1 and EP\/N028201\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,30]]},"DOI":"10.1145\/3205368.3205373","type":"proceedings-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T12:09:54Z","timestamp":1534248594000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Recursive Array Comprehensions in a Call-by-Value Language"],"prefix":"10.1145","author":[{"given":"Artjoms","family":"\u0160inkarovs","sequence":"first","affiliation":[{"name":"School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, Scotland, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven-Bodo","family":"Scholz","sequence":"additional","affiliation":[{"name":"School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, Scotland, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Stewart","sequence":"additional","affiliation":[{"name":"School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, Scotland, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Nikolai","family":"Vie\u00dfmann","sequence":"additional","affiliation":[{"name":"School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, Scotland, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Replicable Parallel Branch and Bound Search. J. Parallel and Distrib. Comput. 113 (March","author":"Archibald Blair","year":"2018","unstructured":"Blair Archibald , Patrick Maier , Ciaran McCreesh , Robert Stewart , and Phil Trinder . 2018. Replicable Parallel Branch and Bound Search. J. Parallel and Distrib. Comput. 113 (March 2018 ), 92--114. Blair Archibald, Patrick Maier, Ciaran McCreesh, Robert Stewart, and Phil Trinder. 2018. Replicable Parallel Branch and Bound Search. J. Parallel and Distrib. Comput. 113 (March 2018), 92--114."},{"key":"e_1_3_2_1_2_1","volume-title":"Culler","author":"Arvind","year":"1986","unstructured":"Arvind and David E . Culler . 1986 . Annual Review of Computer Science Vol. 1, 1986. Chapter Dataflow Architectures , 225--253. Arvind and David E. Culler. 1986. Annual Review of Computer Science Vol. 1, 1986. Chapter Dataflow Architectures, 225--253."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/69558.69562"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2010.5558637"},{"key":"e_1_3_2_1_5_1","volume-title":"Conventional and uniqueness typing in graph rewrite systems. Springer Berlin Heidelberg","author":"Barendsen Erik","year":"1993","unstructured":"Erik Barendsen and Sjaak Smetsers . 1993 . Conventional and uniqueness typing in graph rewrite systems. Springer Berlin Heidelberg , Berlin, Heidelberg, 41--51. Erik Barendsen and Sjaak Smetsers. 1993. Conventional and uniqueness typing in graph rewrite systems. Springer Berlin Heidelberg, Berlin, Heidelberg, 41--51."},{"volume-title":"Nepal --- Nested Data Parallelism in Haskell","author":"Chakravarty Manuel M. T.","key":"e_1_3_2_1_6_1","unstructured":"Manuel M. T. Chakravarty , Gabriele Keller , Roman Lechtchinsky , and Wolf Pfannenstiel . 2001. Nepal --- Nested Data Parallelism in Haskell . Springer Berlin Heidelberg , Berlin, Heidelberg , 524--534. Manuel M. T. Chakravarty, Gabriele Keller, Roman Lechtchinsky, and Wolf Pfannenstiel. 2001. Nepal --- Nested Data Parallelism in Haskell. Springer Berlin Heidelberg, Berlin, Heidelberg, 524--534."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926354.1926358"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535887"},{"key":"e_1_3_2_1_9_1","unstructured":"Chas Emerick Brian Carper and Christophe Grand. 2012. Clojure Programming - Practical LISP for the Java World. O'Reilly.   Chas Emerick Brian Carper and Christophe Grand. 2012. Clojure Programming - Practical LISP for the Java World. O'Reilly."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407931"},{"key":"e_1_3_2_1_11_1","volume-title":"Van Loan","author":"Golub Gene H.","year":"2013","unstructured":"Gene H. Golub and Charles F . Van Loan . 2013 . Matrix Computations (4 ed.). John Hopkins University Press . http:\/\/www.ebook.de\/de\/product\/20241149\/gene_h_golub_matrix_computations.html Gene H. Golub and Charles F. Van Loan. 2013. Matrix Computations (4 ed.). John Hopkins University Press. http:\/\/www.ebook.de\/de\/product\/20241149\/gene_h_golub_matrix_computations.html"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-006-0018-x"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/359060.359067"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627373.2627388"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-009-9042-z"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/32.2.98"},{"key":"e_1_3_2_1_17_1","volume-title":"The Swift Programming Language","author":"Apple Inc. 2014.","unstructured":"Apple Inc. 2014. The Swift Programming Language ( 1 st ed.). Apple Inc., USA. Apple Inc. 2014. The Swift Programming Language (1st ed.). Apple Inc., USA.","edition":"1"},{"key":"e_1_3_2_1_18_1","unstructured":"Kristian Damm Jensen Peter Hj\u00e6resen and Mads Rosendahl. 1994. Efficient Strictness Analysis of Haskell. In SAS. 246--362.  Kristian Damm Jensen Peter Hj\u00e6resen and Mads Rosendahl. 1994. Efficient Strictness Analysis of Haskell. In SAS. 246--362."},{"volume-title":"STACS 87, FranzJ","author":"Kahn G.","key":"e_1_3_2_1_19_1","unstructured":"G. Kahn . 1987. Natural semantics . In STACS 87, FranzJ . Brandenburg, Guy Vidal-Naquet, and Martin Wirsing (Eds.). Lecture Notes in Computer Science, Vol. 247 . Springer Berlin Heidelberg , 22--39. G. Kahn. 1987. Natural semantics. In STACS 87, FranzJ. Brandenburg, Guy Vidal-Naquet, and Martin Wirsing (Eds.). Lecture Notes in Computer Science, Vol. 247. Springer Berlin Heidelberg, 22--39."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01018827"},{"key":"e_1_3_2_1_21_1","volume-title":"Real World OCaml","author":"Minsky Yaron","year":"1983","unstructured":"Yaron Minsky , Anil Madhavapeddy , and Jason Hickey . 2013. Real World OCaml . O'Reilly Media, Inc , USA. http:\/\/www.ebook.de\/de\/product\/ 1983 3727\/jason_hickey_anil_madhavapeddy_yaron_minsky_real_world_ocaml.html Yaron Minsky, Anil Madhavapeddy, and Jason Hickey. 2013. Real World OCaml. O'Reilly Media, Inc, USA. http:\/\/www.ebook.de\/de\/product\/19833727\/jason_hickey_anil_madhavapeddy_yaron_minsky_real_world_ocaml.html"},{"key":"e_1_3_2_1_22_1","volume-title":"Programming in Scala: A Comprehensive Step-by-Step Guide, 2Nd Edition","author":"Odersky Martin","unstructured":"Martin Odersky , Lex Spoon , and Bill Venners . 2011. Programming in Scala: A Comprehensive Step-by-Step Guide, 2Nd Edition ( 2 nd ed.). Artima Incorporation , USA. Martin Odersky, Lex Spoon, and Bill Venners. 2011. Programming in Scala: A Comprehensive Step-by-Step Guide, 2Nd Edition (2nd ed.). Artima Incorporation, USA.","edition":"2"},{"volume-title":"Programming with Python","author":"Padmanabhan T. R.","key":"e_1_3_2_1_23_1","unstructured":"T. R. Padmanabhan . 2016. Programming with Python . Springer . T. R. Padmanabhan. 2016. Programming with Python. Springer."},{"key":"e_1_3_2_1_24_1","volume-title":"Nikhil","author":"Rishiyur Version","year":"1991","unstructured":"Version Rishiyur , Rishiyur S. Nikhil , and Rishiyur S . Nikhil . 1991 . ID Language Reference Manual . (1991). Version Rishiyur, Rishiyur S. Nikhil, and Rishiyur S. Nikhil. 1991. ID Language Reference Manual. (1991)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004458"},{"key":"e_1_3_2_1_26_1","volume-title":"Learning Perl - Making Easy Things Easy and Hard Things Possible: Covers Perl 5.14","author":"Schwartz Randal L.","unstructured":"Randal L. Schwartz , Brian D. Foy , and Tom Phoenix . 2011. Learning Perl - Making Easy Things Easy and Hard Things Possible: Covers Perl 5.14 ( 6 th ed.). O'Reilly . Randal L. Schwartz, Brian D. Foy, and Tom Phoenix. 2011. Learning Perl - Making Easy Things Easy and Hard Things Possible: Covers Perl 5.14 (6th ed.). O'Reilly.","edition":"6"},{"key":"e_1_3_2_1_27_1","volume-title":"A Lambda Calculus for Transfinite Arrays: Unifying Arrays and Streams. CoRR abs\/1710.03832","author":"\u0160inkarovs Artjoms","year":"2017","unstructured":"Artjoms \u0160inkarovs and Sven-Bodo Scholz . 2017. A Lambda Calculus for Transfinite Arrays: Unifying Arrays and Streams. CoRR abs\/1710.03832 ( 2017 ). arXiv:1710.03832 http:\/\/arxiv.org\/abs\/1710.03832 Artjoms \u0160inkarovs and Sven-Bodo Scholz. 2017. A Lambda Calculus for Transfinite Arrays: Unifying Arrays and Streams. CoRR abs\/1710.03832 (2017). arXiv:1710.03832 http:\/\/arxiv.org\/abs\/1710.03832"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784754"},{"volume-title":"AlphaZ: A System for Design Space Exploration in the Polyhedral Model","author":"Yuki Tomofumi","key":"e_1_3_2_1_29_1","unstructured":"Tomofumi Yuki , Gautam Gupta , DaeGon Kim , Tanveer Pathan , and Sanjay Rajopadhye . 2013. AlphaZ: A System for Design Space Exploration in the Polyhedral Model . Springer Berlin Heidelberg, Berlin , Heidelberg , 17--31. Tomofumi Yuki, Gautam Gupta, DaeGon Kim, Tanveer Pathan, and Sanjay Rajopadhye. 2013. AlphaZ: A System for Design Space Exploration in the Polyhedral Model. Springer Berlin Heidelberg, Berlin, Heidelberg, 17--31."}],"event":{"name":"IFL 2017: 29th Symposium on the Implementation and Application of Functional Programming Languages","sponsor":["ACM Association for Computing Machinery","The University of Bristol The University of Bristol","ERLANG Erlang Solutions Ltd."],"location":"Bristol United Kingdom","acronym":"IFL 2017"},"container-title":["Proceedings of the 29th Symposium on the Implementation and Application of Functional Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205368.3205373","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205368.3205373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:55Z","timestamp":1750208935000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205368.3205373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,30]]},"references-count":29,"alternative-id":["10.1145\/3205368.3205373","10.1145\/3205368"],"URL":"https:\/\/doi.org\/10.1145\/3205368.3205373","relation":{},"subject":[],"published":{"date-parts":[[2017,8,30]]},"assertion":[{"value":"2017-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}