On genericity and parametricity

Catriel Beeri*, Tova Milo, Paula Ta-Shma

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations

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 languageEnglish
Pages104-116
Number of pages13
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS - Montreal, Can
Duration: 3 Jun 19965 Jun 1996

Conference

ConferenceProceedings of the 1996 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS
CityMontreal, Can
Period3/06/965/06/96

Fingerprint

Dive into the research topics of 'On genericity and parametricity'. Together they form a unique fingerprint.

Cite this