{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:36:52Z","timestamp":1720201012009},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T00:00:00Z","timestamp":1527552000000},"content-version":"vor","delay-in-days":1489,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1016\/j.tcs.2014.02.029","type":"journal-article","created":{"date-parts":[[2014,2,26]],"date-time":"2014-02-26T21:45:34Z","timestamp":1393451134000},"page":"62-69","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Exhaustive generation of atomic combinatorial differential operators"],"prefix":"10.1016","volume":"536","author":[{"given":"Hugo","family":"Tremblay","sequence":"first","affiliation":[]},{"given":"Gilbert","family":"Labelle","sequence":"additional","affiliation":[]},{"given":"Sre\u010dko","family":"Brlek","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Blondin Mass\u00e9","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2014.02.029_br0010","series-title":"Category Theory","author":"Awodey","year":"2006"},{"key":"10.1016\/j.tcs.2014.02.029_br0020","article-title":"Combinatorial Species and Tree-Like Structures","volume":"vol. 67","author":"Bergeron","year":"1998"},{"key":"10.1016\/j.tcs.2014.02.029_br0030","series-title":"Proceedings of the 2009 ACM SIGPLAN Workshop on ML, ML'09","first-page":"61","article-title":"Fast and sound random generation for automated testing and benchmarking in objective caml","author":"Canou","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2014.02.029_br0040","first-page":"11","article-title":"Classification des esp\u00e8ces mol\u00e9culaires de degr\u00e9 6 et 7","volume":"17","author":"Chiricota","year":"1993","journal-title":"Ann. Sci. Math. Qu\u00e9."},{"key":"10.1016\/j.tcs.2014.02.029_br0050","series-title":"ICFP","first-page":"268","article-title":"Quickcheck: a lightweight tool for random testing of Haskell programs","author":"Claessen","year":"2000"},{"key":"10.1016\/j.tcs.2014.02.029_br0060","series-title":"Foundations of Software Science and Computational Structures","first-page":"25","article-title":"Mathematical models of computational and combinatorial structures","volume":"vol. 3441","author":"Fiore","year":"2005"},{"key":"10.1016\/j.tcs.2014.02.029_br0070","series-title":"Typed Lambda Calculi and Applications","first-page":"163","article-title":"Differential structure in models of multiplicative biadditive intuitionistic linear logic","volume":"vol. 4583","author":"Fiore","year":"2007"},{"key":"10.1016\/j.tcs.2014.02.029_br0080","series-title":"GAP \u2013 Groups, Algorithms, and Programming, Version 4.4.12","author":"The GAP Group","year":"2008"},{"key":"10.1016\/j.tcs.2014.02.029_br0090","first-page":"1","article-title":"Une th\u00e9orie combinatoire des s\u00e9ries formelles","volume":"vol. 42","author":"Joyal","year":"1981"},{"key":"10.1016\/j.tcs.2014.02.029_br0100","series-title":"Combinatoire \u00e9num\u00e9rative, Proceedings","first-page":"126","article-title":"Foncteurs analytiques et esp\u00e8ces de structures","volume":"vol. 1234","author":"Joyal","year":"1985"},{"issue":"B61Ag","key":"10.1016\/j.tcs.2014.02.029_br0110","article-title":"General combinatorial differential operators","volume":"61A","author":"Labelle","year":"2009","journal-title":"S\u00e9min. Lothar. Comb."},{"key":"10.1016\/j.tcs.2014.02.029_br0120","series-title":"Proceedings of the First ACM SIGPLAN Symposium on Haskell, Haskell'08","first-page":"37","article-title":"Smallcheck and lazy smallcheck: automatic exhaustive testing for small values","author":"Runciman","year":"2008"},{"key":"10.1016\/j.tcs.2014.02.029_br0130","series-title":"Op\u00e9rateurs combinatoires diff\u00e9rentiels g\u00e9n\u00e9ralis\u00e9s","author":"Sney-Lacasse","year":"2007"},{"key":"10.1016\/j.tcs.2014.02.029_br0140","author":"Stein"},{"key":"10.1016\/j.tcs.2014.02.029_br0150","series-title":"Combinatoire \u00e9num\u00e9rative, Proceedings","first-page":"351","article-title":"The calculus of virtual species and K-species","volume":"vol. 1234","author":"Yeh","year":"1985"},{"key":"10.1016\/j.tcs.2014.02.029_br0160","series-title":"Proceedings of the Third ACM Haskell Symposium on Haskell, Haskell'10","first-page":"147","article-title":"Species and functors and types, oh my!","author":"Yorgey","year":"2010"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514001455?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514001455?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T09:57:11Z","timestamp":1538819831000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397514001455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":16,"alternative-id":["S0304397514001455"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.02.029","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2014,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exhaustive generation of atomic combinatorial differential operators","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.02.029","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}