{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:28Z","timestamp":1750306708060,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T00:00:00Z","timestamp":1406505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/I011005\/1, EP\/I010335\/1]"],"award-info":[{"award-number":["EP\/I011005\/1, EP\/I010335\/1]"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,28]]},"DOI":"10.1145\/2631948.2631950","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"3-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated theorem proving for special functions"],"prefix":"10.1145","author":[{"given":"Lawrence C.","family":"Paulson","sequence":"first","affiliation":[{"name":"Univ. of Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2014,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-009-9149-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/4.3.217"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50004-7"},{"key":"e_1_3_2_1_4_1","volume-title":"Special functions: continued fraction and series representations","author":"Backeljauw F.","year":"2008","unstructured":"F. Backeljauw , S. Becuwe , M. Colman , A. Cuyt , and T. Docx . Special functions: continued fraction and series representations , 2008 . On the Internet at http:\/\/www.cfhblive.ua.ac.be\/. F. Backeljauw, S. Becuwe, M. Colman, A. Cuyt, and T. Docx. Special functions: continued fraction and series representations, 2008. On the Internet at http:\/\/www.cfhblive.ua.ac.be\/."},{"key":"e_1_3_2_1_5_1","volume-title":"Essentials of Pad\u00e9 Approximants","author":"Baker George A.","year":"1975","unstructured":"George A. Baker , Jr. Essentials of Pad\u00e9 Approximants . Academic Press , 1975 . George A. Baker, Jr. Essentials of Pad\u00e9 Approximants. Academic Press, 1975."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development: Coq'Art: The Calculus of Inductive Constructions","author":"Bertot Yves","year":"2004","unstructured":"Yves Bertot and Pierre Cast\u00e9ran . Interactive Theorem Proving and Program Development: Coq'Art: The Calculus of Inductive Constructions . Springer , 2004 . Yves Bertot and Pierre Cast\u00e9ran. Interactive Theorem Proving and Program Development: Coq'Art: The Calculus of Inductive Constructions. Springer, 2004."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129511000090"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-012-9245-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/968708.968710"},{"key":"e_1_3_2_1_10_1","volume-title":"Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. Logical Methods in Computer Science, 8(1)","author":"Cohen Cyril","year":"2012","unstructured":"Cyril Cohen and Assia Mahboubi . Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. Logical Methods in Computer Science, 8(1) , 2012 . Cyril Cohen and Assia Mahboubi. Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. Logical Methods in Computer Science, 8(1), 2012."},{"key":"e_1_3_2_1_11_1","volume-title":"Handbook of Continued Fractions for Special Functions","author":"Cuyt A.","year":"2008","unstructured":"A. Cuyt , V. Petersen , B. Verdonk , H. Waadeland , and W. B. Jones . Handbook of Continued Fractions for Special Functions . Springer , 2008 . A. Cuyt, V. Petersen, B. Verdonk, H. Waadeland, and W. B. Jones. Handbook of Continued Fractions for Special Functions. Springer, 2008."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80004-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06410-9_14"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1986308.1986319"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005843212881"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005843632307"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-012-9256-3"},{"key":"e_1_3_2_1_18_1","volume-title":"A Proof Assistant for Higher-Order Logic","author":"Nipkow Tobias","year":"2002","unstructured":"Tobias Nipkow , Lawrence C. Paulson , and Markus Wenzel . Isabelle\/HOL : A Proof Assistant for Higher-Order Logic . Springer , 2002 . LNCS Tutorial 2283. Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. Springer, 2002. LNCS Tutorial 2283."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/647765.735995"}],"event":{"name":"SNC '14: Symbolic-Numeric Computation 2014","sponsor":["973 Program National Basic Research Program of China","KLMM Key Laboratory of Mathematics Mechanization","MapleSoft","ORCCA Ontario Research Centre for Computer Algebra","NSFC Natural Science Foundation of China","Chinese Academy of Engineering Chinese Academy of Engineering","NAG Numerical Algorithms Group","ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Shanghai China","acronym":"SNC '14"},"container-title":["Proceedings of the 2014 Symposium on Symbolic-Numeric Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2631948.2631950","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2631948.2631950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:13Z","timestamp":1750231153000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2631948.2631950"}},"subtitle":["the next phase"],"short-title":[],"issued":{"date-parts":[[2014,7,28]]},"references-count":19,"alternative-id":["10.1145\/2631948.2631950","10.1145\/2631948"],"URL":"https:\/\/doi.org\/10.1145\/2631948.2631950","relation":{},"subject":[],"published":{"date-parts":[[2014,7,28]]},"assertion":[{"value":"2014-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}