{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:21:43Z","timestamp":1760080903632,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T00:00:00Z","timestamp":1704758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","award":["NIF\\R1\\221748"],"award-info":[{"award-number":["NIF\\R1\\221748"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,1,9]]},"DOI":"10.1145\/3636501.3636948","type":"proceedings-article","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T19:39:27Z","timestamp":1704829167000},"page":"205-217","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments"],"prefix":"10.1145","author":[{"given":"Joseph","family":"Eremondi","sequence":"first","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,1,9]]},"reference":[{"volume-title":"Github Issue: Equality is incompatible with sized types. https:\/\/github.com\/agda\/agda\/issues\/2820","year":"2017","key":"e_1_3_2_1_1_1","unstructured":"Agda-Developers. 2017. Github Issue: Equality is incompatible with sized types. https:\/\/github.com\/agda\/agda\/issues\/2820"},{"key":"e_1_3_2_1_2_1","unstructured":"Guillaume Allais Edwin Brady Nathan Corbyn Ohad Kammar and Jeremy Yallop. 2023. Frex: dependently-typed algebraic simplification. arxiv:cs.PL\/2306.15375."},{"volume-title":"Interactive Theorem Proving and Program Development","author":"Bertot Yves","key":"e_1_3_2_1_3_1","unstructured":"Yves Bertot and Pierre Cast\u00e9ran. 2004. Interactive Theorem Proving and Program Development. Springer-Verlag."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.01.017"},{"key":"e_1_3_2_1_5_1","volume-title":"Idris 2: Quantitative Type Theory in Practice. CoRR, abs\/2104.00480","author":"Brady Edwin C.","year":"2021","unstructured":"Edwin C. Brady. 2021. Idris 2: Quantitative Type Theory in Practice. CoRR, abs\/2104.00480 (2021), arxiv:2104.00480. arxiv:2104.00480"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14288\/1.0416401"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1938-06720-1"},{"volume-title":"Proof Synthesis with Free Extensions in Intensional Type Theory","author":"Corbyn Nathan","key":"e_1_3_2_1_8_1","unstructured":"Nathan Corbyn. 2021. Proof Synthesis with Free Extensions in Intensional Type Theory. University of Cambridge. MEng Dissertation."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1979.82.43"},{"volume-title":"Automated Deduction - CADE-25, Amy P","author":"de Moura Leonardo","key":"e_1_3_2_1_10_1","unstructured":"Leonardo de Moura, Soonho Kong, Jeremy Avigad, Floris van Doorn, and Jakob von Raumer. 2015. The Lean Theorem Prover (System Description). In Automated Deduction - CADE-25, Amy P. Felty and Aart Middeldorp (Eds.). Springer International Publishing, Cham. 378\u2013388. isbn:978-3-319-21401-6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Joey Eremondi. 2023. JoeyEremondi\/smb-trees: An Agda Library for Strictly Monotone Brouwer Trees. https:\/\/doi.org\/10.5281\/zenodo.10204397 10.5281\/zenodo.10204397","DOI":"10.5281\/zenodo.10204397"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.240882"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2267778"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113843"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004829"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1481861.1481862"},{"key":"e_1_3_2_1_18_1","unstructured":"The Univalent Foundations Program. 2013. Homotopy Type Theory: Univalent Foundations of Mathematics. https:\/\/homotopytypetheory.org\/book Institute for Advanced Study."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341691"}],"event":{"name":"CPP '24: 13th ACM SIGPLAN International Conference on Certified Programs and Proofs","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"London UK","acronym":"CPP '24"},"container-title":["Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3636501.3636948","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3636501.3636948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:54:11Z","timestamp":1750287251000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3636501.3636948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,9]]},"references-count":18,"alternative-id":["10.1145\/3636501.3636948","10.1145\/3636501"],"URL":"https:\/\/doi.org\/10.1145\/3636501.3636948","relation":{},"subject":[],"published":{"date-parts":[[2024,1,9]]},"assertion":[{"value":"2024-01-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}