{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:06Z","timestamp":1750220826289,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T00:00:00Z","timestamp":1579478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100012693","name":"Yale-NUS College","doi-asserted-by":"publisher","award":["R-607-265-322-121"],"award-info":[{"award-number":["R-607-265-322-121"]}],"id":[{"id":"10.13039\/100012693","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CRYSTAL CENTRE"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,1,20]]},"DOI":"10.1145\/3372885.3373837","type":"proceedings-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T13:09:33Z","timestamp":1579698573000},"page":"129-142","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A functional proof pearl: inverting the Ackermann hierarchy"],"prefix":"10.1145","author":[{"given":"Linh","family":"Tran","sequence":"first","affiliation":[{"name":"Yale University, USA \/ National University of Singapore, Singapore"}]},{"given":"Anshuman","family":"Mohan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Aquinas","family":"Hobor","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Wilhelm Ackermann. 1928. Zum Hilbertschen Aufbau der reellen Zahlen. Math. Ann. 99 1 (01 Dec 1928) 118\u2013133.  Wilhelm Ackermann. 1928. Zum Hilbertschen Aufbau der reellen Zahlen. Math. Ann. 99 1 (01 Dec 1928) 118\u2013133.","DOI":"10.1007\/BF01459088"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Yves Bertot and Pierre Cast\u00e9ran. 2004. Interactive Theorem Proving and Program Development - Coq\u2019Art: The Calculus of Inductive Constructions. Springer.  Yves Bertot and Pierre Cast\u00e9ran. 2004. Interactive Theorem Proving and Program Development - Coq\u2019Art: The Calculus of Inductive Constructions. Springer.","DOI":"10.1007\/978-3-662-07964-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-017-9431-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355562"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Adam Chlipala. 2013. Certified Programming with Dependent Types - A Pragmatic Introduction to the Coq Proof Assistant. MIT Press.  Adam Chlipala. 2013. Certified Programming with Dependent Types - A Pragmatic Introduction to the Coq Proof Assistant. MIT Press.","DOI":"10.7551\/mitpress\/9153.001.0001"},{"key":"e_1_3_2_1_6_1","unstructured":"Coq development team. 2019. The Coq proof assistant. https:\/\/coq. inria.fr\/  Coq development team. 2019. The Coq proof assistant. https:\/\/coq. inria.fr\/"},{"key":"e_1_3_2_1_7_1","unstructured":"Ren\u00e9 Descartes. 1637. Discourse de la M\u00e9thode.  Ren\u00e9 Descartes. 1637. Discourse de la M\u00e9thode."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/2266486"},{"key":"e_1_3_2_1_9_1","unstructured":"Robert A. Heinlein. 1966. The Moon Is a Harsh Mistress. G. P. Putnam\u2019s Sons.  Robert A. Heinlein. 1966. The Moon Is a Harsh Mistress. G. P. Putnam\u2019s Sons."},{"key":"e_1_3_2_1_10_1","unstructured":"Johannes H\u00f6lzl and Fabian Immler. 2012. Theory Log_Nat. https:\/\/www.isa-afp.org\/browser_info\/current\/AFP\/IEEE_Floating_ Point\/Log_Nat.html  Johannes H\u00f6lzl and Fabian Immler. 2012. Theory Log_Nat. https:\/\/www.isa-afp.org\/browser_info\/current\/AFP\/IEEE_Floating_ Point\/Log_Nat.html"},{"key":"e_1_3_2_1_11_1","unstructured":"Inv-Ack. 2019. inv-ack\/inv-ack. https:\/\/github.com\/inv-ack\/inv-ack  Inv-Ack. 2019. inv-ack\/inv-ack. https:\/\/github.com\/inv-ack\/inv-ack"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"D. E. Knuth. 1976. Mathematics and Computer Science: Coping with Finiteness. Science 194 4271 (1976) 1235\u20131242.  D. E. Knuth. 1976. Mathematics and Computer Science: Coping with Finiteness. Science 194 4271 (1976) 1235\u20131242.","DOI":"10.1126\/science.194.4271.1235"},{"key":"e_1_3_2_1_13_1","unstructured":"Assia Mahboubi and Enrico Tassi. 2018. Mathematical Components. https:\/\/math-comp.github.io\/mcb\/  Assia Mahboubi and Enrico Tassi. 2018. Mathematical Components. https:\/\/math-comp.github.io\/mcb\/"},{"key":"e_1_3_2_1_14_1","unstructured":"John Napier. 1614. Mirifici Logarithmorum Canonis Descriptio.  John Napier. 1614. Mirifici Logarithmorum Canonis Descriptio."},{"key":"e_1_3_2_1_15_1","unstructured":"Gabriel Nivasch. 2009. Inverse Ackermann without pain. http: \/\/www.gabrielnivasch.org\/fun\/inverse-ackermann  Gabriel Nivasch. 2009. Inverse Ackermann without pain. http: \/\/www.gabrielnivasch.org\/fun\/inverse-ackermann"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"R\u00f3zsa P\u00e9ter. 1935. Konstruktion nichtrekursiver Funktionen. Math. Ann. 111 1 (01 Dec 1935) 42\u201360.  R\u00f3zsa P\u00e9ter. 1935. Konstruktion nichtrekursiver Funktionen. Math. Ann. 111 1 (01 Dec 1935) 42\u201360.","DOI":"10.1007\/BF01472200"},{"key":"e_1_3_2_1_17_1","unstructured":"Benjamin C Pierce. 2019. An Evaluation Function for Imp. https: \/\/softwarefoundations.cis.upenn.edu\/lf-current\/ImpCEvalFun.html  Benjamin C Pierce. 2019. An Evaluation Function for Imp. https: \/\/softwarefoundations.cis.upenn.edu\/lf-current\/ImpCEvalFun.html"},{"key":"e_1_3_2_1_18_1","unstructured":"Raimund Seidel. 2006. Understanding the Inverse Ackermann Function. http:\/\/cgi.di.uoa.gr\/~ewcg06\/invited\/Seidel.pdf  Raimund Seidel. 2006. Understanding the Inverse Ackermann Function. http:\/\/cgi.di.uoa.gr\/~ewcg06\/invited\/Seidel.pdf"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/62.2160"},{"key":"e_1_3_2_1_21_1","unstructured":"Isabelle Development Team. 2013. The Isabelle2013 Library. https: \/\/isabelle.in.tum.de\/website-Isabelle2013\/dist\/library\/index.html  Isabelle Development Team. 2013. The Isabelle2013 Library. https: \/\/isabelle.in.tum.de\/website-Isabelle2013\/dist\/library\/index.html"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Linh Tran Anshuman Mohan and Aquinas Hobor. 2019. A Functional Proof Pearl: Inverting the Ackermann Hierarchy (Extended Version). (2019). https:\/\/www.comp.nus.edu.sg\/~hobor\/Publications\/ 2020\/inverse_ack_extended_cpp2020.pdf  Linh Tran Anshuman Mohan and Aquinas Hobor. 2019. A Functional Proof Pearl: Inverting the Ackermann Hierarchy (Extended Version). (2019). https:\/\/www.comp.nus.edu.sg\/~hobor\/Publications\/ 2020\/inverse_ack_extended_cpp2020.pdf","DOI":"10.1145\/3372885.3373837"}],"event":{"name":"POPL '20: 47th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"New Orleans LA USA","acronym":"POPL '20"},"container-title":["Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372885.3373837","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372885.3373837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:22Z","timestamp":1750202002000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372885.3373837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,20]]},"references-count":22,"alternative-id":["10.1145\/3372885.3373837","10.1145\/3372885"],"URL":"https:\/\/doi.org\/10.1145\/3372885.3373837","relation":{},"subject":[],"published":{"date-parts":[[2020,1,20]]},"assertion":[{"value":"2020-01-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}