Formal models for a computer and for programs are introduced. These models are used to develop a theory for programs based on the underlying computational structure of the computer to be programmed. Several notions of “well-behaved” programs are introduced. Necessary and sufficient conditions for converting arbitrary programs to “well-behaved” programs are derived
AbstractWe here extend our earlier work on the theory of computer instructions to consider instructi...
Nowadays computation is typically understood through the Turing machine model, in the fields of comp...
Despite the insight of some of the pioneers (Turing, von Neumann, Curry, Böhm), programming the earl...
Formal models for a computer and for programs are introduced. These models are used to develop a the...
This paper has arisen from an attempt to determine the nature of computer instructions from a viewpo...
AbstractJust as there is a theory of groups, or rings, or fields, or topological spaces, so there is...
This paper presents an algebraic theory of instruction sequences with instructions for Turing tapes ...
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the p...
This paper is based on a previous work of the first author [16] in which a mathematical model of the...
This paper presents an algebraic theory of instruction sequences with instructions for a random acce...
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
This thesis presents a formal apparatus which is adequate both to express the termination and correc...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
This paper reports on a proposed schema and gives some detailed specifications for constructing a le...
AbstractThe principal ideas of a universal computer are gradually introduced into a functional model...
AbstractWe here extend our earlier work on the theory of computer instructions to consider instructi...
Nowadays computation is typically understood through the Turing machine model, in the fields of comp...
Despite the insight of some of the pioneers (Turing, von Neumann, Curry, Böhm), programming the earl...
Formal models for a computer and for programs are introduced. These models are used to develop a the...
This paper has arisen from an attempt to determine the nature of computer instructions from a viewpo...
AbstractJust as there is a theory of groups, or rings, or fields, or topological spaces, so there is...
This paper presents an algebraic theory of instruction sequences with instructions for Turing tapes ...
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the p...
This paper is based on a previous work of the first author [16] in which a mathematical model of the...
This paper presents an algebraic theory of instruction sequences with instructions for a random acce...
A parameterized algebraic theory of instruction sequences, objects that represent the behaviours pro...
This thesis presents a formal apparatus which is adequate both to express the termination and correc...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
This paper reports on a proposed schema and gives some detailed specifications for constructing a le...
AbstractThe principal ideas of a universal computer are gradually introduced into a functional model...
AbstractWe here extend our earlier work on the theory of computer instructions to consider instructi...
Nowadays computation is typically understood through the Turing machine model, in the fields of comp...
Despite the insight of some of the pioneers (Turing, von Neumann, Curry, Böhm), programming the earl...
DOI
Add to ORKG