{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T17:25:32Z","timestamp":1778520332040,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T00:00:00Z","timestamp":1199664000000},"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":[[2008,1,7]]},"DOI":"10.1145\/1328438.1328445","type":"proceedings-article","created":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T09:45:40Z","timestamp":1199699140000},"page":"29-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Much ado about two (pearl)"],"prefix":"10.1145","author":[{"given":"Janis","family":"Voigtl\u00e4nder","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Dresden, 01062 Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,1,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"35","volume-title":"Synthesis of Parallel Algorithms","author":"Blelloch G. E.","year":"1993","unstructured":"G. E. Blelloch . Prefix sums and their applications . In J. H. Reif, editor, Synthesis of Parallel Algorithms , pages 35 -- 60 . Morgan Kaufmann , 1993 . G. E. Blelloch. Prefix sums and their applications. In J. H. Reif, editor, Synthesis of Parallel Algorithms, pages 35--60. Morgan Kaufmann, 1993."},{"key":"e_1_3_2_1_2_1","volume-title":"Technische Universit\u00e4t Dresden","author":"B\u00f6hme S.","year":"2007","unstructured":"S. B\u00f6hme . Free theorems for sublanguages of Haskell. Master's thesis , Technische Universit\u00e4t Dresden , 2007 a. S. B\u00f6hme. Free theorems for sublanguages of Haskell. Master's thesis, Technische Universit\u00e4t Dresden, 2007a."},{"key":"e_1_3_2_1_3_1","unstructured":"S. B\u00f6hme. Much ado about two. Formal proof development. In G. Klein T. Nipkow and L. Paulson editors The Archive of Formal Proofs. http:\/\/afp.sf.net\/entries\/MuchAdoAboutTwo.shtml 2007b.  S. B\u00f6hme. Much ado about two. Formal proof development. In G. Klein T. Nipkow and L. Paulson editors The Archive of Formal Proofs. http:\/\/afp.sf.net\/entries\/MuchAdoAboutTwo.shtml 2007b."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11617990_6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804666"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111056"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2004.07.002"},{"issue":"4","key":"e_1_3_2_1_9_1","first-page":"353","article-title":"Proof methods for corecursive programs","volume":"66","author":"Gibbons J.","year":"2005","unstructured":"J. Gibbons and G. Hutton . Proof methods for corecursive programs . Fundamenta Informaticae , 66 ( 4 ): 353 -- 366 , 2005 . J. Gibbons and G. Hutton. Proof methods for corecursive programs. Fundamenta Informaticae, 66(4):353--366, 2005.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-540-27764-4_11","volume-title":"Mathematics of Program Construction, Proceedings","author":"Hinze R.","year":"2004","unstructured":"R. Hinze . An algebra of scans . In Mathematics of Program Construction, Proceedings , volume 3125 of LNCS , pages 186 -- 210 . Springer--Verlag , 2004 . R. Hinze. An algebra of scans. In Mathematics of Program Construction, Proceedings, volume 3125 of LNCS, pages 186--210. Springer--Verlag, 2004."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964010"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/872021.872455"},{"key":"e_1_3_2_1_13_1","volume-title":"Sorting and Searching. Addison--Wesley","author":"Knuth D. E.","year":"1973","unstructured":"D. E. Knuth . The Art of Computer Programming , volume 3 : Sorting and Searching. Addison--Wesley , 1973 . D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison--Wesley, 1973."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2003.09.004"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1991.145553"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","volume-title":"Isabelle\/HOL - A Proof Assistant for Higher-Order Logic","author":"Nipkow T.","year":"2002","unstructured":"T. Nipkow , L. C. Paulson , and M. Wenzel . Isabelle\/HOL - A Proof Assistant for Higher-Order Logic , volume 2283 of LNCS . Springer-Verlag , 2002 . T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle\/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer-Verlag, 2002."},{"key":"e_1_3_2_1_18_1","volume-title":"Haskell 98 Language and Libraries: The Revised Report","author":"Peyton Jones S. L.","year":"2003","unstructured":"S. L. Peyton Jones , editor. Haskell 98 Language and Libraries: The Revised Report . Cambridge University Press , 2003 . S. L. Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003."},{"key":"e_1_3_2_1_19_1","first-page":"513","volume-title":"Information Processing, Proceedings","author":"Reynolds J. C.","year":"1983","unstructured":"J. C. Reynolds . Types , abstraction and parametric polymorphism . In Information Processing, Proceedings , pages 513 -- 523 . Elsevier Science Publishers B. V. , 1983 . J. C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing, Proceedings, pages 513--523. Elsevier Science Publishers B. V., 1983."},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/978-3-540-39724-3_4","volume-title":"Correct Hardware Design and Verification Methods, Proceedings","author":"Sheeran M.","year":"2003","unstructured":"M. Sheeran . Finding regularity: Describing and analysing circuits that are not quite regular . In Correct Hardware Design and Verification Methods, Proceedings , volume 2860 of LNCS , pages 4 -- 18 . Springer-Verlag , 2003 . M. Sheeran. Finding regularity: Describing and analysing circuits that are not quite regular. In Correct Hardware Design and Verification Methods, Proceedings, volume 2860 of LNCS, pages 4--18. Springer-Verlag, 2003."},{"issue":"7","key":"e_1_3_2_1_21_1","first-page":"1135","article-title":"Hardware design and functional programming: a perfect match","volume":"11","author":"Sheeran M.","year":"2005","unstructured":"M. Sheeran . Hardware design and functional programming: a perfect match . Journal of Universal Computer Science , 11 ( 7 ): 1135 -- 1158 , 2005 . M. Sheeran. Hardware design and functional programming: a perfect match. Journal of Universal Computer Science, 11(7):1135--1158, 2005.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_1_22_1","volume-title":"Searching for prefix networks to fit in a context using a lazy functional programming language. Talk at Hardware Design and Functional Languages","author":"Sheeran M.","year":"2007","unstructured":"M. Sheeran . Searching for prefix networks to fit in a context using a lazy functional programming language. Talk at Hardware Design and Functional Languages , 2007 . M. Sheeran. Searching for prefix networks to fit in a context using a lazy functional programming language. Talk at Hardware Design and Functional Languages, 2007."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5219822"},{"issue":"8","key":"e_1_3_2_1_24_1","first-page":"786","article-title":"A parallel algorithm for the efficient solution of a general class of recurrence equations","volume":"22","author":"Stone H. S.","year":"1973","unstructured":"H. S. Stone and P. M. Kogge . A parallel algorithm for the efficient solution of a general class of recurrence equations . IEEE Transactions on Computers , 22 ( 8 ): 786 -- 793 , 1973 . H. S. Stone and P. M. Kogge. A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Transactions on Computers, 22(8):786--793, 1973.","journal-title":"IEEE Transactions on Computers"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99404"}],"event":{"name":"POPL08: The 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Francisco California USA","acronym":"POPL08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328445","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1328438.1328445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:56:07Z","timestamp":1750240567000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328445"}},"subtitle":["a pearl on parallel prefix computation"],"short-title":[],"issued":{"date-parts":[[2008,1,7]]},"references-count":24,"alternative-id":["10.1145\/1328438.1328445","10.1145\/1328438"],"URL":"https:\/\/doi.org\/10.1145\/1328438.1328445","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1328897.1328445","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,1,7]]},"assertion":[{"value":"2008-01-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}