We introduce an algebra with free variables, an algebra with undefined values, a program algebra over a term algebra, an algebra with integers, and an algebra with arrays. Program algebra is defined as universal algebra with assignments. Programs depend on the set of generators with supporting variables and supporting terms which determine the value of free variables in the next state. The execution of a program is changing state according to successor function using supporting terms
AbstractThe need to integrate several versions of a program into a common one arises frequently, but...
This paper provides the description of my research project on the computational power a programming ...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
This paper considers a programming language where all control is encoded in algebras and combinators...
AbstractIn the setting of program algebra (PGA), a projection from PGAu, i.e., PGA extended with a u...
We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as a...
A new approach to the formal description of programming language semantics is described and illustr...
We describe an automated partial evaluator for evolving algebras implemented at the University of Mi...
Functional programs are merely equations; they may be manipulated by straightforward equational reas...
Summary. This paper is a continuation of [5] and concerns if-while alge-bras over integers. In these...
A simple algebra-based algorithm for compiler generation is described. Its input is a semantic defi...
The functions behavior of a deterministic program segment is a function f:D→D, where D is some set o...
Program variables in a call-by-value mode are added to the elementary syntax of program algebra. Onl...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
AbstractThe need to integrate several versions of a program into a common one arises frequently, but...
This paper provides the description of my research project on the computational power a programming ...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
This paper considers a programming language where all control is encoded in algebras and combinators...
AbstractIn the setting of program algebra (PGA), a projection from PGAu, i.e., PGA extended with a u...
We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as a...
A new approach to the formal description of programming language semantics is described and illustr...
We describe an automated partial evaluator for evolving algebras implemented at the University of Mi...
Functional programs are merely equations; they may be manipulated by straightforward equational reas...
Summary. This paper is a continuation of [5] and concerns if-while alge-bras over integers. In these...
A simple algebra-based algorithm for compiler generation is described. Its input is a semantic defi...
The functions behavior of a deterministic program segment is a function f:D→D, where D is some set o...
Program variables in a call-by-value mode are added to the elementary syntax of program algebra. Onl...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
AbstractThe need to integrate several versions of a program into a common one arises frequently, but...
This paper provides the description of my research project on the computational power a programming ...
The jump instruction is considered essential for an adequate theoretical understanding of imperative...