{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:30:58Z","timestamp":1725762658189},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"We introduce and discuss a term-rewriting technique to convert numbers from any nu- meric base to any other one without explicitly appealing to division. The rewrite system is purely local and conversion has a quadratic complexity, matching the one of the standard base-conversion algorithm. We prove confluence and termination, and give an implemen- tation and benchmarks in the Dedukti type checker. This work extends and generalizes a previous work by Delahaye, published in a vulgarization scientific review.<\/jats:p>","DOI":"10.29007\/21t9","type":"proceedings-article","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T22:10:12Z","timestamp":1716847812000},"page":"92-76","source":"Crossref","is-referenced-by-count":0,"title":["Numeric Base Conversion with Rewriting"],"prefix":"10.29007","volume":"18","author":[{"given":"Olivier","family":"Hermant","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Loboda","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"LPAR 2024 Complementary Volume"},"container-title":["Kalpa Publications in Computing"],"original-title":[],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T22:10:13Z","timestamp":1716847813000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/qk3c"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/21t9","relation":{},"ISSN":["2515-1762"],"issn-type":[{"type":"print","value":"2515-1762"}],"subject":[]}}