{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T05:19:36Z","timestamp":1780723176198,"version":"3.54.1"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["713999"],"award-info":[{"award-number":["713999"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chinese Academy of Sciences President?s International Fellowship for Postdoctoral Researchers","award":["2021PT0015"],"award-info":[{"award-number":["2021PT0015"]}]},{"name":"Netherlands Organization for Scientific Research","award":["016.Vidi.189.037"],"award-info":[{"award-number":["016.Vidi.189.037"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61732001"],"award-info":[{"award-number":["61732001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:p>A new generation of automatic theorem provers eliminate bugs in software and mathematics.<\/jats:p>","DOI":"10.1145\/3557998","type":"journal-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T14:41:50Z","timestamp":1679582510000},"page":"80-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Mechanical Mathematicians"],"prefix":"10.1145","volume":"66","author":[{"given":"Alexander","family":"Bentkamp","sequence":"first","affiliation":[{"name":"State Key Laboratory of Computer Science, Institute of Software, CAS, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jasmin","family":"Blanchette","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Visa","family":"Nummelin","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sophie","family":"Tourret","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lorraine, CNRS, Inria, LORIA, Nancy, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petar","family":"Vukmirovi\u0107","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uwe","family":"Waldmann","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,3,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00252180"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/4.3.217"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50004-7"},{"key":"e_1_2_1_4_1","volume-title":"CADE-27 (LNCS","author":"Barbosa H.","unstructured":"Barbosa, H., Reynolds, A., Ouraoui, D.E., Tinelli, C., Barrett, C.W. Extending SMT solvers to higher-order logic. In CADE-27 (LNCS, Vol. 11716), P. Fontaine, ed., (2019). Springer, 35--54."},{"key":"e_1_2_1_5_1","volume-title":"CADE-28 (LNCS","author":"Bentkamp A.","unstructured":"Bentkamp, A., Blanchette, J., Tourret, S., Vukmirovi\u0107, P. Superposition for full higher-order logic. In CADE-28 (LNCS, Vol. 12699), A. Platzer, G. Sutcliffe, eds. (2021). Springer, 396--412."},{"key":"e_1_2_1_6_1","volume-title":"CADE-15 (LNCS","author":"Benzm\u00fcller C.","unstructured":"Benzm\u00fcller, C., Kohlhase, M. Extensional higher-order resolution. In CADE-15 (LNCS, Vol. 1421), C. Kirchner, H. Kirchner, eds. (1998). Springer, 56--71."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-015-9348-y"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51074-9_16"},{"key":"e_1_2_1_9_1","first-page":"1","article-title":"Hammering towards QED","volume":"9","author":"Blanchette J.C.","year":"2016","unstructured":"Blanchette, J.C., Kaliszyk, C., Paulson, L.C., Urban, J. Hammering towards QED. J. Formaliz. Reason. 9, 1 (2016), 101--148.","journal-title":"J. Formaliz. Reason."},{"key":"e_1_2_1_10_1","volume-title":"IJCAR 2012 (LNCS","volume":"117","author":"Brown C.E.","unstructured":"Brown, C.E. Satallax: An automatic higher-order prover. In IJCAR 2012 (LNCS, Vol. 7364), B. Gramlich, D. Miller, U. Sattler, eds. (2012). Springer, 111--117."},{"key":"e_1_2_1_11_1","first-page":"1","article-title":"A note on the Entscheidungsproblem","volume":"1","author":"Church A","year":"1936","unstructured":"Church, A. A note on the Entscheidungsproblem. J. Symb. Logic 1, 1 (1936), 40--41.","journal-title":"J. Symb. Logic"},{"key":"e_1_2_1_12_1","volume-title":"ITP 2022 (LIPIcs","author":"Desharnais M.","year":"2022","unstructured":"Desharnais, M., Vukmirovi\u0107, P., Blanchette, J., Wenzel, M. Seventeen provers under the hammer. In ITP 2022 (LIPIcs, Vol. 237), J. Andronick, L. de Moura, eds. (2022). Schloss Dagstuhl---Leibniz-Zentrum f\u00fcr Informatik, 8:1--8:18."},{"key":"e_1_2_1_13_1","first-page":"1","article-title":"\u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I","volume":"38","author":"G\u00f6del K","year":"1931","unstructured":"G\u00f6del, K. \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I. Monatshefte f\u00fcr Mathematik und Physik 38, 1 (1931), 173--198.","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"key":"e_1_2_1_14_1","volume-title":"IJCAI-73","author":"Huet G.P.","unstructured":"Huet, G.P. A mechanization of type theory. In IJCAI-73, N.J. Nilsson, ed. (1973). William Kaufmann, 139--146."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(73)90301-X"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90011-0"},{"key":"e_1_2_1_17_1","volume-title":"IJCAR 2014 (LNCS","volume":"75","author":"Lindblad F.","unstructured":"Lindblad, F. A focused sequent calculus for higher-order logic. In IJCAR 2014 (LNCS, Vol. 8562), S. Demri, D. Kapur, C. Weidenbach, eds. (2014). Springer, 61--75."},{"key":"e_1_2_1_18_1","first-page":"129","article-title":"The undecidability of the unification problem for third order languages","volume":"2059","author":"Lucchesi C.L","year":"1972","unstructured":"Lucchesi, C.L. The undecidability of the unification problem for third order languages. Report CSRR 2059 (1972), 129--198.","journal-title":"Report CSRR"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536616.1536637"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/321752.321764"},{"key":"e_1_2_1_21_1","first-page":"73","article-title":"Building-in equational theories","volume":"7","author":"Plotkin G","year":"1972","unstructured":"Plotkin, G. Building-in equational theories. Mach. Intell. 7 (1972), 73--90.","journal-title":"Mach. Intell."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/321250.321253"},{"key":"e_1_2_1_23_1","volume-title":"CADE-27 (LNCS","author":"Schulz S.","unstructured":"Schulz, S., Cruanes, S., Vukmirovi\u0107, P. Faster, higher, stronger: E 2.3. In CADE-27 (LNCS, Vol. 11716), P. Fontaine, ed. (2019). Springer, 495--507."},{"key":"e_1_2_1_24_1","volume-title":"IJCAR 2018 (LNCS","volume":"116","author":"Steen A.","unstructured":"Steen, A., Benzm\u00fcller, C. The higher-order prover Leo-III. In IJCAR 2018 (LNCS, Vol. 10900), D. Galmiche, S. Schulz, R. Sebastiani, eds. (2018). Springer, 108--116."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/193198"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2012.12.002"},{"key":"e_1_2_1_27_1","first-page":"2","volume":"37","author":"Sutcliffe G","year":"2016","unstructured":"Sutcliffe, G. The CADE ATP System Competition---CASC. AI Mag. 37, 2 (2016), 99--101.","journal-title":"The CADE ATP System Competition---CASC. AI Mag."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-210235"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-42.1.230"},{"key":"e_1_2_1_30_1","volume-title":"CADE-28 (LNCS","author":"Vukmirovi\u0107","unstructured":"Vukmirovi\u0107; , P., Bentkamp, A., Blanchette, J., Cruanes, S., Nummelin, V., Tourret, S. Making higher-order superposition work. In CADE-28 (LNCS, Vol. 12699), A. Platzer, G. Sutcliffe, eds. (2021). Springer, 415--432."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-021-00639-7"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3557998","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3557998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:32Z","timestamp":1750182572000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3557998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,23]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["10.1145\/3557998"],"URL":"https:\/\/doi.org\/10.1145\/3557998","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,23]]},"assertion":[{"value":"2023-03-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}