DOIAbstract
AbstractIn the setting of program algebra (PGA), a projection from PGAu, i.e., PGA extended with a unit instruction operator, into PGA is defined. This is done via a composition that employs backward jumps and (labeled) goto's
AbstractIn the setting of program algebra (PGA), a projection from PGAu, i.e., PGA extended with a unit instruction operator, into PGA is defined. This is done via a composition that employs backward jumps and (labeled) goto's
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequ...
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instru...
AbstractIn the setting of program algebra (PGA), a projection from PGAu, i.e., PGA extended with a u...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
AbstractWe study sequential programs that are instruction sequences with jump-shift instructions in ...
We study sequential programs that are instruction sequences with jump-shift instructions in the sett...
AbstractThe jump instruction is considered essential for an adequate theoretical understanding of im...
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction...
On the basis of the program notation PGLD of program algebra, a program notation PGLDg (PGLD with g...
PGA, short for ProGram Algebra, describes sequential programs as finite or infinite (repeating) sequ...
We introduce an algebra with free variables, an algebra with undefined values, a program algebra ove...
We define a notion of program which is not a computer program but an operator program: a detailed de...
AbstractThis paper shows that program algebra (PGA) [J.A. Bergstra, M.E. Loots, Program algebra for ...
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequ...
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instru...
AbstractIn the setting of program algebra (PGA), a projection from PGAu, i.e., PGA extended with a u...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
AbstractWe study sequential programs that are instruction sequences with jump-shift instructions in ...
We study sequential programs that are instruction sequences with jump-shift instructions in the sett...
AbstractThe jump instruction is considered essential for an adequate theoretical understanding of im...
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction...
On the basis of the program notation PGLD of program algebra, a program notation PGLDg (PGLD with g...
PGA, short for ProGram Algebra, describes sequential programs as finite or infinite (repeating) sequ...
We introduce an algebra with free variables, an algebra with undefined values, a program algebra ove...
We define a notion of program which is not a computer program but an operator program: a detailed de...
AbstractThis paper shows that program algebra (PGA) [J.A. Bergstra, M.E. Loots, Program algebra for ...
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequ...
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instru...
Add to ORKG