{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:41:35Z","timestamp":1743129695005,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319197968"},{"type":"electronic","value":"9783319197975"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19797-5_6","type":"book-chapter","created":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T15:56:37Z","timestamp":1433951797000},"page":"113-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Functors Constrained by Regular Expressions"],"prefix":"10.1007","author":[{"given":"Dan","family":"Piponi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brent A.","family":"Yorgey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,9]]},"reference":[{"issue":"1\u20132","key":"6_CR1","first-page":"1","volume":"65","author":"M Abbott","year":"2005","unstructured":"Abbott, M., Altenkirch, T., McBride, C., Ghani, N.: $$\\partial $$ for data: differentiating data structures. Fundam. Inform. 65(1\u20132), 1\u201328 (2005)","journal-title":"Fundam. Inform."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Stephen, D.: Fun with semirings: a functional pearl on the abuse of linear algebra. In: ACM SIGPLAN Notices, vol. 48, pp. 101\u2013110. ACM (2013)","DOI":"10.1145\/2544174.2500613"},{"volume-title":"Handbook of Weighted Automata","year":"2009","key":"6_CR3","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer Science & Business Media, Heidelberg (2009)"},{"issue":"4\u20135","key":"6_CR4","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1017\/S0963548304006315","volume":"13","author":"P Duchon","year":"2004","unstructured":"Duchon, P., Flajolet, P., Louchard, G., Schaeffer, G.: Boltzmann samplers for the random generation of combinatorial structures. Comb. Probab. Comput. 13(4\u20135), 577\u2013625 (2004)","journal-title":"Comb. Probab. Comput."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0956796897002864","volume":"7","author":"G Huet","year":"1997","unstructured":"Huet, G.: Functional pearl: the zipper. J. Funct. Program. 7, 549\u2013554 (1997)","journal-title":"J. Funct. Program."},{"key":"6_CR6","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. Technical report, DTIC Document (1951)"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","volume":"4","author":"DJ Lehmann","year":"1977","unstructured":"Lehmann, D.J.: Algebraic structures for transitive closure. Theor. Comput. Sci. 4(1), 59\u201376 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR8","unstructured":"Marlow, S.: Haskell 2010 language report (2010). https:\/\/www.haskell.org\/onlinereport\/haskell2010\/"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"McBride, C.: Clowns to the left of me, jokers to the right (pearl): dissecting data structures. In: POPL, pp. 287\u2013295 (2008)","DOI":"10.1145\/1328897.1328474"},{"issue":"01","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796807006326","volume":"18","author":"C McBride","year":"2008","unstructured":"McBride, C., Paterson, R.: Applicative programming with effects. J. Funct. Program. 18(01), 1\u201313 (2008)","journal-title":"J. Funct. Program."},{"key":"6_CR11","unstructured":"O\u2019Connor, R.: A very general method for computing shortest paths (2011). http:\/\/r6.ca\/blog\/20110808T035622Z.html"},{"key":"6_CR12","unstructured":"Piponi, D.: Finite differences of types (2009). http:\/\/blog.sigfpe.com\/2009\/09\/finite-differences-of-types.html"},{"key":"6_CR13","unstructured":"Piponi, D.: Constraining types with regular expressions (2010). http:\/\/blog.sigfpe.com\/2010\/08\/constraining-types-with-regular.html"},{"key":"6_CR14","unstructured":"Piponi, D.: Divided differences and the tomography of types (2010). http:\/\/blog.sigfpe.com\/2010\/08\/divided-differences-and-tomography-of.html"},{"key":"6_CR15","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2012","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Cengage Learning, Boston (2012)"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10990-008-9037-1","volume":"21","author":"JM Siskind","year":"2008","unstructured":"Siskind, J.M., Pearlmutter, B.A.: Nesting forward-mode ad in a functional framework. High.-Order Symb. Comput. 21(4), 361\u2013376 (2008)","journal-title":"High.-Order Symb. Comput."},{"key":"6_CR17","unstructured":"Stay, M., Jokers, Q., Clowns (2014). https:\/\/reperiendi.wordpress.com\/2014\/08\/05\/q-jokers-and-clowns\/"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"key":"6_CR19","unstructured":"Yorgey, B.A.: On a problem of SIGFPE (2010). https:\/\/byorgey.wordpress.com\/2010\/08\/12\/on-a-problem-of-sigfpe\/"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19797-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T07:02:59Z","timestamp":1672124579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19797-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319197968","9783319197975"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19797-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}