Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows
Jan Aldert Bergstra, Inge Bethke · Theory of Computing Systems · 2010
A combination of program algebra with the theory of meadows is designed leading to a theory of computation in algebraic structures. It is proven that total functions on cancellation meadows can be computed by straight-line programs using at most five auxiliary variables. A similar result is obtained for signed meadows.