25 citations · 290 across the 54 of their papers we have counts for
18 papers · 1 filter
Program algebra for random access machine programs
C. A. Middelburg
This paper presents an algebraic theory of instruction sequences with instructions for a random access machine (RAM) as basic instructions, the behaviours produced by the instructi…
Program algebra for Turing-machine programs
J. A. Bergstra, C. A. Middelburg
This paper presents an algebraic theory of instruction sequences with instructions for Turing tapes as basic instructions, the behaviours produced by the instruction sequences conc…
A short introduction to program algebra with instructions for Boolean registers
J. A. Bergstra, C. A. Middelburg
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours produced by instruction sequences under execution, and objects that represent the b…
Axioms for behavioural congruence of single-pass instruction sequences
J. A. Bergstra, C. A. Middelburg
In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on instruction sequences are paid attention to: instruction sequence congruence, str…
On instruction sets for Boolean registers in program algebra
J. A. Bergstra, C. A. Middelburg
In previous work carried out in the setting of program algebra, including work in the area of instruction sequence size complexity, we chose instruction sets for Boolean registers…
Long multiplication by instruction sequences with backward jump instructions
J. A. Bergstra, C. A. Middelburg
For each function on bit strings, its restriction to bit strings of any given length can be computed by a finite instruction sequence that contains only instructions to set and get…