Canonical constraints for parameterized data types
This paper presents a comparatively general method for specifying a ‘data constraint’ on a parameterized data type (i.e., specifying just which category of algebras it is supposed to be defined or correct on), and shows that there is a simple canonical form for such constraint specifications. We als...
Saved in:
| Published in | Theoretical computer science Vol. 50; no. 3; pp. 323 - 349 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
1987
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | This paper presents a comparatively general method for specifying a ‘data constraint’ on a parameterized data type (i.e., specifying just which category of algebras it is supposed to be defined or correct on), and shows that there is a simple canonical form for such constraint specifications. We also show how such constraints may be employed to give ‘loose’ specifications of data types. |
|---|---|
| ISSN: | 0304-3975 1879-2294 |
| DOI: | 10.1016/0304-3975(87)90119-8 |