Numeric Base Conversion with Rewriting

15 pages•Published: May 26, 2024

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.

Keyphrases: base conversion, numeric bases, term rewriting

In: Nikolaj Bjørner, Marijn Heule and Andrei Voronkov (editors). LPAR 2024 Complementary Volume, vol 18, pages 92-106.

Links:	https://easychair.org/publications/paper/qk3c
	https://doi.org/10.29007/21t9

BibTeX entry

@inproceedings{LPAR2024C:Numeric_Base_Conversion_with,
  author    = {Olivier Hermant and Wojciech Loboda},
  title     = {Numeric Base Conversion with Rewriting},
  booktitle = {LPAR 2024 Complementary Volume},
  editor    = {Nikolaj Bjørner and Marijn Heule and Andrei Voronkov},
  series    = {Kalpa Publications in Computing},
  volume    = {18},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/qk3c},
  doi       = {10.29007/21t9},
  pages     = {92-106},
  year      = {2024}}

Download PDF Open PDF in browser