{"id":"https://openalex.org/W4390783149","doi":"https://doi.org/10.1145/3636501.3636948","title":"Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments","display_name":"Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments","publication_year":2024,"publication_date":"2024-01-09","ids":{"openalex":"https://openalex.org/W4390783149","doi":"https://doi.org/10.1145/3636501.3636948"},"language":"en","primary_location":{"id":"doi:10.1145/3636501.3636948","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3636501.3636948","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3636501.3636948","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3636501.3636948","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021805478","display_name":"Joseph Eremondi","orcid":"https://orcid.org/0000-0002-9631-4826"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Joseph Eremondi","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021805478"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.3637,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60738393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"205","last_page":"217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.8206793069839478},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7256383895874023},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7177632451057434},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.5382944941520691},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5365638136863708},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48926636576652527},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4874124825000763},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.44966262578964233},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4412561058998108},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.41504400968551636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3936208188533783},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2858327627182007}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8206793069839478},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7256383895874023},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7177632451057434},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.5382944941520691},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5365638136863708},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48926636576652527},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4874124825000763},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.44966262578964233},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4412561058998108},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.41504400968551636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3936208188533783},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2858327627182007},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3636501.3636948","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3636501.3636948","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3636501.3636948","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3636501.3636948","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3636501.3636948","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3636501.3636948","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1984845735","display_name":null,"funder_award_id":"NIF\\R1\\221748","funder_id":"https://openalex.org/F4320320006","funder_display_name":"Royal Society"}],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390783149.pdf"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1553511155","https://openalex.org/W1982209843","https://openalex.org/W2036869460","https://openalex.org/W2038960886","https://openalex.org/W2062887328","https://openalex.org/W2087403174","https://openalex.org/W2171496589","https://openalex.org/W2964835846","https://openalex.org/W4206739992","https://openalex.org/W4360977267","https://openalex.org/W6904699435","https://openalex.org/W6967232547"],"related_works":["https://openalex.org/W1489292980","https://openalex.org/W2025919169","https://openalex.org/W2074941524","https://openalex.org/W2584778959","https://openalex.org/W3102439663","https://openalex.org/W1596057910","https://openalex.org/W2167424714","https://openalex.org/W252215219","https://openalex.org/W4388322088","https://openalex.org/W2359098868"],"abstract_inverted_index":{"Ordinals":[0],"can":[1,45,60],"be":[2,46,62],"used":[3,63],"to":[4,24,27,64],"prove":[5],"the":[6,47,52,86],"termination":[7],"of":[8,51,54],"dependently":[9],"typed":[10],"programs.":[11],"Brouwer":[12],"trees":[13],"are":[14,71,77,82],"a":[15,38,42],"particular":[16],"ordinal":[17],"notation":[18],"that":[19],"make":[20],"it":[21],"very":[22],"easy":[23],"assign":[25],"sizes":[26,53,81],"higher":[28],"order":[29],"data":[30],"structures.":[31],"They":[32],"extend":[33],"unary":[34],"natural":[35],"numbers":[36],"with":[37],"limit":[39],"constructor,":[40],"so":[41,73],"function's":[43],"size":[44],"least":[48],"upper":[49],"bound":[50],"values":[55,79],"from":[56],"its":[57],"image.":[58],"These":[59],"then":[61],"define":[65],"well-founded":[66],"recursion:":[67],"any":[68],"recursive":[69],"calls":[70],"allowed":[72],"long":[74],"as":[75],"they":[76],"on":[78],"whose":[80],"strictly":[83],"smaller":[84],"than":[85],"current":[87],"size.":[88]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}