Small specifications for large finite data structures
- 1 January 1981
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 9 (4) , 305-320
- https://doi.org/10.1080/00207168108803253
Abstract
Having concerned ourselves with boundedness properties of algebraic data structure specifications in the sense of the ADJ Group (see [4, 6, 7]) before now—see [1], which is in a sense a follow-up of [3] of Bergstra and Tucker—we show in this paper that data structures of cardinality > n can be specified by means of a bounded number of equations, not depending on n, which are each of length O(n) onlyKeywords
This publication has 1 reference indexed in Scilit:
- A Course in Mathematical LogicPublished by Springer Nature ,1977