An Instruction Sequence Semigroup with Repeaters

Abstract

In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction was designed to represent infinite sequences of primitive instructions as finite, linear programs. The resulting mathematical structure is a semigroup. We show that a kernel of this syntax can replace PGA as a carrier for program algebra by providing axioms for defining single-pass congruence and structural congruence, and equations for thread extraction. Finally, we discuss the related program notation PGLA that serves as a basis for PGA’s tool set.

1 Figure or Table

Cite this paper

@article{Bergstra2008AnIS, title={An Instruction Sequence Semigroup with Repeaters}, author={Jan A. Bergstra and Alban Ponse}, journal={CoRR}, year={2008}, volume={abs/0810.1151} }