Abstract
Genericity and parametricity are shown to be closely related, although incomparable. For queries with a general polymorphic type the latter, deriving from the type, can provide more information, such as invariance under mappings on non-base types, and preservation of interpreted domains. It is also shown that many algebraic laws can be derived from parametricity. It follows that, hopefully, type checking and type interface algorithms can be used to verify or discover such properties automatically. This opens new possibilities for optimizing queries defined in general declarative languages, and over user-defined data types.
Original language | English |
---|---|
Pages | 104-116 |
Number of pages | 13 |
State | Published - 1996 |
Externally published | Yes |
Event | Proceedings of the 1996 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS - Montreal, Can Duration: 3 Jun 1996 → 5 Jun 1996 |
Conference
Conference | Proceedings of the 1996 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS |
---|---|
City | Montreal, Can |
Period | 3/06/96 → 5/06/96 |