We are programmers, in the sense that it is our concern to improve the process of program construction. Therefore we want to answer questions like: What is programming, why is it so difficult and error-prone, and how can we learn what is needed to make the process more manageable? In the following we shall address these issues in a relational framework. Section 10.1 gives an introductory overview explaining the background to our approach. Section 10.2 shows how we deal with (recursive and non-recursive) datatypes in the relational framework. Section 10.3 discusses programs in this context, concentrating on a class of programs characterized by relational equations of a specific but quite general shape. Program termination is the subject of S...
Program construction by parts consists of tackling a complex specification one component at a time, ...
AbstractAbstract relational algebra is proposed as a practical means to describe the denotational se...
The derivation of database programs directly from formal specifications is a well known and unsolve...
We are programmers, in the sense that it is our concern to improve the process of program constructi...
We are programmers, in the sense that it is our concern to improve the process of program constructi...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
AbstractIn this paper we demonstrate that the basic rules and calculational techniques used in two e...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
AbstractA common feature of most theoretical investigations on semantics, correctness and terminatio...
Relational program verification is a variant of program verification where one focuses on guaranteei...
Datatype-generic programs are programs that are parameterised by a datatype. We review the allegoric...
Program construction by parts consists of tackling a complex specification one component at a time, ...
AbstractAbstract relational algebra is proposed as a practical means to describe the denotational se...
The derivation of database programs directly from formal specifications is a well known and unsolve...
We are programmers, in the sense that it is our concern to improve the process of program constructi...
We are programmers, in the sense that it is our concern to improve the process of program constructi...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
AbstractIn this paper we demonstrate that the basic rules and calculational techniques used in two e...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
AbstractA common feature of most theoretical investigations on semantics, correctness and terminatio...
Relational program verification is a variant of program verification where one focuses on guaranteei...
Datatype-generic programs are programs that are parameterised by a datatype. We review the allegoric...
Program construction by parts consists of tackling a complex specification one component at a time, ...
AbstractAbstract relational algebra is proposed as a practical means to describe the denotational se...
The derivation of database programs directly from formal specifications is a well known and unsolve...