TypeCase: a design pattern for type-indexed functions Export

@inproceedings{citeulike:342288, abstract = {A type-indexed function is a function that is defined for each member of some family of types. Haskell's type class mechanism provides collections of open type-indexed functions, in which the indexing family can be extended by defining a new type class instance but the collection of functions is fixed. The purpose of this paper is to present TypeCase: a design pattern that allows the definition of closed type-indexed functions, in which the index family is fixed but the collection of functions is extensible. It is inspired by Cheney and Hinze's work on lightweight approaches to generic programming. We generalise their techniques as a design pattern. Furthermore, we show that type-indexed functions with type-indexed types, and consequently generic functions with generic types, can also be encoded in a lightweight manner, thereby overcoming one of the main limitations of the lightweight approaches.}, address = {New York, NY, USA}, author = {Oliveira, Bruno C. and Gibbons, Jeremy}, booktitle = {Haskell '05: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell}, citeulike-article-id = {342288}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1088348.1088358}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1088348.1088358}, doi = {10.1145/1088348.1088358}, isbn = {159593071X}, keywords = {functional-programming, generic-programming, haskell, type-classes, types}, pages = {98--109}, posted-at = {2005-10-06 08:37:09}, priority = {2}, publisher = {ACM Press}, title = {TypeCase: a design pattern for type-indexed functions}, url = {http://dx.doi.org/10.1145/1088348.1088358}, year = {2005} }

TY - CONF ID - citeulike:342288 L3 - citeulike-article-id:342288 N2 - A type-indexed function is a function that is defined for each member of some family of types. Haskell's type class mechanism provides collections of open type-indexed functions, in which the indexing family can be extended by defining a new type class instance but the collection of functions is fixed. The purpose of this paper is to present TypeCase: a design pattern that allows the definition of closed type-indexed functions, in which the index family is fixed but the collection of functions is extensible. It is inspired by Cheney and Hinze's work on lightweight approaches to generic programming. We generalise their techniques as a design pattern. Furthermore, we show that type-indexed functions with type-indexed types, and consequently generic functions with generic types, can also be encoded in a lightweight manner, thereby overcoming one of the main limitations of the lightweight approaches. SN - 159593071X AD - New York, NY, USA EP - 109 TI - TypeCase: a design pattern for type-indexed functions PB - ACM Press T2 - Haskell '05: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell SP - 98 KW - functional-programming KW - generic-programming KW - haskell KW - type-classes KW - types AU - Oliveira, Bruno AU - Gibbons, Jeremy PY - 2005/// UR - http://dx.doi.org/10.1145/1088348.1088358 ER -