A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Finite algebraic specifications of semicomputable data types
[chapter]

1987
*
Lecture Notes in Computer Science
*

0-I ntroduction For many years computer scientists have looked at data objects in terms of axioms which govern the beilaviour of data structures. Such an attempt is called )~bsL'Lac~ Data Type Spec~c~o,l. Abstraction is involved in the fact that only properties which are independent of data representation are considered. In the algebraic approach, initiated in the paper of LISKOV-ZiLLES [1974], data structures are thought of as algebras in the sense of general algebra (see also [ Zi 79] and

doi:10.1007/3-540-17660-8_51
fatcat:wh75z63w25ga5askxd4rryagfe