{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:58Z","timestamp":1750306498585,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,18]],"date-time":"2016-01-18T00:00:00Z","timestamp":1453075200000},"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":[[2016,1,18]]},"DOI":"10.1145\/2854065.2854075","type":"proceedings-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T13:18:57Z","timestamp":1452604737000},"page":"100-109","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Formalization of a Newton series representation of polynomials"],"prefix":"10.1145","author":[{"given":"Cyril","family":"Cohen","sequence":"first","affiliation":[{"name":"Inria, France"}]},{"given":"Boris","family":"Djalal","sequence":"additional","affiliation":[{"name":"Inria, France"}]}],"member":"320","published-online":{"date-parts":[[2016,1,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Programming and Automating Mathematics in the Tarski-Kleene Hierarchy","author":"Alasdair Armstrong T. W.","year":"2014","unstructured":"T. W. Alasdair Armstrong , Georg Struth . Programming and Automating Mathematics in the Tarski-Kleene Hierarchy . 2014 . T. W. Alasdair Armstrong, Georg Struth. Programming and Automating Mathematics in the Tarski-Kleene Hierarchy. 2014."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71067-7_11"},{"key":"e_1_3_2_1_3_1","volume-title":"Algorithmique efficace pour des op\u00e9rations de base en Calcul formel","author":"Bostan A.","year":"2003","unstructured":"A. Bostan . Algorithmique efficace pour des op\u00e9rations de base en Calcul formel . 2003 . A. Bostan. Algorithmique efficace pour des op\u00e9rations de base en Calcul formel. 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9195-9"},{"key":"e_1_3_2_1_5_1","unstructured":"P. Quaresma. DCpic package to draw diagrams in Latex. https:\/\/www. ctan.org\/pkg\/dcpic. Accessed: 25\/06\/2015.  P. Quaresma. DCpic package to draw diagrams in Latex. https:\/\/www. ctan.org\/pkg\/dcpic. Accessed: 25\/06\/2015."},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","first-page":"92","volume-title":"Interactive Theorem Proving","author":"Strub P.-Y.","unstructured":"P.-Y. Strub . A Coq\/ Ssreflect Library for Elliptic Curves . In R. G. Gerwin Klein, editor, Interactive Theorem Proving , volume 8558 of Lecture Notes in Computer Science , pages 77\u2013 92 . Springer, 2014. ISBN 978- 3-319-08970-6. doi: 10.1007\/978-3-319-08970-6_6. URL https:\/\/ github.com\/strub\/elliptic-curves-ssr. Accessed: 3\/07\/2015. 10.1007\/978-3-319-08970-6_6 P.-Y. Strub. A Coq\/Ssreflect Library for Elliptic Curves. In R. G. Gerwin Klein, editor, Interactive Theorem Proving, volume 8558 of Lecture Notes in Computer Science, pages 77\u201392. Springer, 2014. ISBN 978- 3-319-08970-6. doi: 10.1007\/978-3-319-08970-6_6. URL https:\/\/ github.com\/strub\/elliptic-curves-ssr. Accessed: 3\/07\/2015."},{"key":"e_1_3_2_1_7_1","volume-title":"Institute for Advanced Study","author":"Program T. Univalent Foundations","year":"2013","unstructured":"T. Univalent Foundations Program . Homotopy Type Theory: Univalent Foundations of Mathematics. http:\/\/homotopytypetheory.org\/ book , Institute for Advanced Study , 2013 . T. Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics. http:\/\/homotopytypetheory.org\/ book, Institute for Advanced Study, 2013."},{"key":"e_1_3_2_1_8_1","unstructured":"Wikipedia. Composition of series. https:\/\/en.wikipedia.org\/ wiki\/Formal_power_series#Composition_of_series. Accessed: 29\/06\/2015.  Wikipedia. Composition of series. https:\/\/en.wikipedia.org\/ wiki\/Formal_power_series#Composition_of_series. Accessed: 29\/06\/2015."}],"event":{"name":"CPP 2016: Certified Proofs and Programs","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"St. Petersburg FL USA","acronym":"CPP 2016"},"container-title":["Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854075","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2854065.2854075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:47Z","timestamp":1750225727000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,18]]},"references-count":8,"alternative-id":["10.1145\/2854065.2854075","10.1145\/2854065"],"URL":"https:\/\/doi.org\/10.1145\/2854065.2854075","relation":{},"subject":[],"published":{"date-parts":[[2016,1,18]]},"assertion":[{"value":"2016-01-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}