On algorithmic equivalence of instruction sequences for computing bit string functions
Abstract
Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We look for an equivalence relation on instruction sequences of this kind that captures to a reasonable degree the intuitive notion that two instruction sequences express the same algorithm.
Cite
@article{arxiv.1402.4950,
title = {On algorithmic equivalence of instruction sequences for computing bit string functions},
author = {J. A. Bergstra and C. A. Middelburg},
journal= {arXiv preprint arXiv:1402.4950},
year = {2015}
}
Comments
27 pages, the preliminaries have textual overlaps with the preliminaries in arXiv:1308.0219 [cs.PL], arXiv:1312.1529 [cs.PL], and arXiv:1312.1812 [cs.PL]; 27 pages, three paragraphs about Milner's algorithmic equivalence hypothesis added to concluding remarks; 26 pages, several minor improvements of the presentation made