{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T17:04:44Z","timestamp":1751648684876,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,23]],"date-time":"2012-01-23T00:00:00Z","timestamp":1327276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,23]]},"DOI":"10.1145\/2103746.2103762","type":"proceedings-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T16:47:19Z","timestamp":1327423639000},"page":"73-82","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["StagedSAC"],"prefix":"10.1145","author":[{"given":"Vlad","family":"Ureche","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiark","family":"Rompf","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Sujeeth","sequence":"additional","affiliation":[{"name":"Stanford, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hassan","family":"Chafi","sequence":"additional","affiliation":[{"name":"Stanford, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Odersky","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"The Delite framework repository. URL https:\/\/github.com\/ stanford-ppl\/Delite.  The Delite framework repository. URL https:\/\/github.com\/ stanford-ppl\/Delite."},{"key":"e_1_3_2_2_2_1","unstructured":"The Lightweight Modular Staging framework repository. URL https:\/\/github.com\/TiarkRompf\/virtualization-lms-core.  The Lightweight Modular Staging framework repository. URL https:\/\/github.com\/TiarkRompf\/virtualization-lms-core."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8534-8_9"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.15"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869527"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094852"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158707"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/169683.174155"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/582153.582176"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010095604496"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27861-0_8"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11964681_11"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460833.1460872"},{"key":"e_1_3_2_2_15_1","volume-title":"The FISh language definition. Technical report","author":"Jay C. B.","year":"1998","unstructured":"C. B. Jay . The FISh language definition. Technical report , 1998 . C. B. Jay. The FISh language definition. Technical report, 1998."},{"key":"e_1_3_2_2_16_1","volume-title":"A Hybrid Shared Memory Exection Model for SAC. Diploma thesis","author":"Kuthe S.","year":"2005","unstructured":"S. Kuthe . A Hybrid Shared Memory Exection Model for SAC. Diploma thesis , Institute for Software Technology and Programming Languages , University of Lubeck, 2005 . S. Kuthe. A Hybrid Shared Memory Exection Model for SAC. Diploma thesis, Institute for Software Technology and Programming Languages, University of Lubeck, 2005."},{"key":"e_1_3_2_2_18_1","volume-title":"Programming in Scala: A Comprehensive Step-by-Step Guide","author":"Odersky M.","year":"2011","unstructured":"M. Odersky , L. Spoon , and B. Venners . Programming in Scala: A Comprehensive Step-by-Step Guide , 2 nd Edition. Artima Inc, 2011 . ISBN 0981531644. M. Odersky, L. Spoon, and B. Venners. Programming in Scala: A Comprehensive Step-by-Step Guide, 2nd Edition. Artima Inc, 2011. ISBN 0981531644.","edition":"2"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868294.1868314"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.66.5"},{"key":"e_1_3_2_2_21_1","volume-title":"With-loop-folding in Sac-condensing consecutive array operations. IFL","author":"Scholz S.-B.","year":"1998","unstructured":"S.-B. Scholz . With-loop-folding in Sac-condensing consecutive array operations. IFL . 1998 . S.-B. Scholz. With-loop-folding in Sac-condensing consecutive array operations. IFL. 1998."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004458"},{"key":"e_1_3_2_2_23_1","volume-title":"SAC 1.0 Tutorial","author":"Scholz S.-B.","year":"2010","unstructured":"S.-B. Scholz , S. Herhut , F. Penczek , and C. Grelck . SAC 1.0 Tutorial , 2010 . URL http:\/\/www.sac-home.org\/publications\/tutorial.pdf. S.-B. Scholz, S. Herhut, F. Penczek, and C. Grelck. SAC 1.0 Tutorial, 2010. URL http:\/\/www.sac-home.org\/publications\/tutorial.pdf."},{"key":"e_1_3_2_2_24_1","volume-title":"OptiML: An Implicitly Parallel Domain-Specific Language for Machine Learning. In ICML'11","author":"Sujeeth A. K.","year":"2011","unstructured":"A. K. Sujeeth , H. Lee , K. J. Brown , T. Rompf , H. Chafi , M. Wu , A. R. Atreya , M. Odersky , and K. Olukotun . OptiML: An Implicitly Parallel Domain-Specific Language for Machine Learning. In ICML'11 , 2011 . A. K. Sujeeth, H. Lee, K. J. Brown, T. Rompf, H. Chafi, M. Wu, A. R. Atreya, M. Odersky, and K. Olukotun. OptiML: An Implicitly Parallel Domain-Specific Language for Machine Learning. In ICML'11, 2011."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2009.03.002"}],"event":{"name":"POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Philadelphia Pennsylvania USA","acronym":"POPL '12"},"container-title":["Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103746.2103762","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103746.2103762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:35Z","timestamp":1750241195000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103746.2103762"}},"subtitle":["a case study in performance-oriented DSL development"],"short-title":[],"issued":{"date-parts":[[2012,1,23]]},"references-count":23,"alternative-id":["10.1145\/2103746.2103762","10.1145\/2103746"],"URL":"https:\/\/doi.org\/10.1145\/2103746.2103762","relation":{},"subject":[],"published":{"date-parts":[[2012,1,23]]},"assertion":[{"value":"2012-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}