{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:15:49Z","timestamp":1750220149882,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001773","name":"University of New South Wales","doi-asserted-by":"publisher","award":[""],"award-info":[{"award-number":[""]}],"id":[{"id":"10.13039\/501100001773","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001782","name":"University of Melbourne","doi-asserted-by":"publisher","award":[""],"award-info":[{"award-number":[""]}],"id":[{"id":"10.13039\/501100001782","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,29]]},"DOI":"10.1145\/3563768.3563958","type":"proceedings-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T18:49:27Z","timestamp":1669920567000},"page":"75-77","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Termination of Recursive Functions by Lexicographic Orders of Linear Combinations"],"prefix":"10.1145","author":[{"given":"Raphael","family":"Douglas Giles","sequence":"first","affiliation":[{"name":"UNSW, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"foetus\u2013termination checker for simple functional programs. Programming Lab Report, 474","author":"Abel Andreas","year":"1998","unstructured":"Andreas Abel. 1998. foetus\u2013termination checker for simple functional programs. Programming Lab Report, 474 (1998)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004191"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74591-4_5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47813-2_9"},{"key":"e_1_3_2_1_5_1","volume-title":"International Workshop on Types for Proofs and Programs. 39\u201359","author":"Gim\u00e9nez Eduarde","year":"1994","unstructured":"Eduarde Gim\u00e9nez. 1994. Codifying guarded definitions with recursive schemes. In International Workshop on Types for Proofs and Programs. 39\u201359."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_34"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/113413.113433"}],"event":{"name":"SPLASH Companion '22: 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Auckland New Zealand","acronym":"SPLASH Companion '22"},"container-title":["Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3563768.3563958","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3563768.3563958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:07Z","timestamp":1750186807000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3563768.3563958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,29]]},"references-count":7,"alternative-id":["10.1145\/3563768.3563958","10.1145\/3563768"],"URL":"https:\/\/doi.org\/10.1145\/3563768.3563958","relation":{},"subject":[],"published":{"date-parts":[[2022,11,29]]},"assertion":[{"value":"2022-12-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}