Data Categories

@incollection{citeulike:1214254, abstract = {Data categories and functors, and the strong natural transformations between them provide a universe in which to model parametric polymorphism. Data functors are distinguished by being decomposable into shape and data, i.e. they represent types that store data. Every strong transformation between two such is given by a uniform algorithm, and so may represent a polymorphic term. The data functors are closed under composition, finite products and sums, exponentiation by an object, final...}, author = {Jay, Barry C. }, booktitle = {Proceedings Computing---The Australasian Theory Symp., CATS'96, Melbourne, Australia, 29--30 Jan 1996}, citeulike-article-id = {1214254}, editor = {Houle, M. E. and Eades, P. }, keywords = {category, datatypes}, pages = {21--28}, posted-at = {2007-04-06 23:34:27}, priority = {2}, title = {Data Categories}, url = {http://citeseer.ist.psu.edu/138170.html}, volume = {18}, year = {1996} }

TY - CHAP ID - citeulike:1214254 L3 - citeulike-article-id:1214254 N2 - Data categories and functors, and the strong natural transformations between them provide a universe in which to model parametric polymorphism. Data functors are distinguished by being decomposable into shape and data, i.e. they represent types that store data. Every strong transformation between two such is given by a uniform algorithm, and so may represent a polymorphic term. The data functors are closed under composition, finite products and sums, exponentiation by an object, final... EP - 28 TI - Data Categories VL - 18 T2 - Proceedings Computing---The Australasian Theory Symp., CATS'96, Melbourne, Australia, 29--30 Jan 1996 SP - 21 KW - category KW - datatypes AU - Jay, Barry A2 - Houle, ME A2 - Eades, P PY - 1996/// UR - http://citeseer.ist.psu.edu/138170.html ER -