| Sequential Data Algebra Primitives (1996) | |||||||||||||||
Abstract | |||||||||||||||
| this paper is to develop a family of data type specifications and a particular method for writing such specifications based on the four valued logic of [BBR95]. The method is an informal one cast in a number of design rules for specifications of data algebras. The phrase data algebra is used rather than abstract data type in order to emphasise that the data types are first order many sorted algebras that comply a number of requirements (design rules). The four valued (McCarthyan) logic, the new notations for list operators, the omnipresent divergent and meaningless objects, and the very hierarchy of modules below can be viewed as primitives for data algebra. Because all operations including the logical connectives are sequential in the sense that they inspect their arguments in some definite order this style of data algebra is called sequential data algebra. Evidently what we propose is only a choice from an infinite number of different options. So what is being developed below is in fact a set of primitives for a style of sequential data algebra. Modules written in that style indicate so by having a name ending with DA. | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||