An Instruction Sequence Semigroup with Repeaters

Details An Instruction Sequence Semigroup with Repeaters An Instruction Sequence Semigroup with Repeaters

2008-10-07

arxiv.org/abs/0810.1151v1

Computer Science

Programming Languages

12 pages, 4 tables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Instruction Sequence Semigroup with Repeaters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Instruction Sequence Semigroup with Repeaters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Instruction Sequence Semigroup with Repeaters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-557014