A Pattern for Almost Compositional Functions Export

@inproceedings{citeulike:1781499, abstract = {This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional" means that for a number of the constructors in the type(s), the result of the function depends only on the constructor and the results of calling the function on the constructor's arguments. The pattern consists of a generic part constructed once for each data type or family of data types, and a task-specific part. The generic part contains the code for the predictable compositional cases, leaving the interesting work to the task-specific part. Examples of the pattern implemented in dependent type theory with inductive families, in Haskell with generalized algebraic data types and rank-2 polymorphism, and in Java using a variant of the Visitor design pattern are given. The relationship to the "Scrap Your Boilerplate" approach to generic programming, and to general tree types in dependent type theory are also investigated.}, address = {New York, NY, USA}, author = {Bringert, Bj\"{o}rn and Ranta, Aarne}, booktitle = {ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming}, citeulike-article-id = {1781499}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1159803.1159834}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1159803.1159834}, citeulike-linkout-2 = {http://www.cs.chalmers.se/~bringert/publ/composOp/composOp.pdf}, doi = {10.1145/1159803.1159834}, issn = {0362-1340}, keywords = {dependent-types, gadts, generics, haskell, inductive-type-families, syb, traversals}, pages = {216--226}, posted-at = {2009-02-05 12:57:59}, priority = {2}, publisher = {ACM Press}, title = {A Pattern for Almost Compositional Functions}, url = {http://dx.doi.org/10.1145/1159803.1159834}, year = {2006} }

TY - CONF ID - citeulike:1781499 L3 - citeulike-article-id:1781499 N2 - This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional" means that for a number of the constructors in the type(s), the result of the function depends only on the constructor and the results of calling the function on the constructor's arguments. The pattern consists of a generic part constructed once for each data type or family of data types, and a task-specific part. The generic part contains the code for the predictable compositional cases, leaving the interesting work to the task-specific part. Examples of the pattern implemented in dependent type theory with inductive families, in Haskell with generalized algebraic data types and rank-2 polymorphism, and in Java using a variant of the Visitor design pattern are given. The relationship to the "Scrap Your Boilerplate" approach to generic programming, and to general tree types in dependent type theory are also investigated. SN - 0362-1340 AD - New York, NY, USA EP - 226 TI - A Pattern for Almost Compositional Functions PB - ACM Press T2 - ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming SP - 216 KW - dependent-types KW - gadts KW - generics KW - haskell KW - inductive-type-families KW - syb KW - traversals AU - Bringert, Björn AU - Ranta, Aarne PY - 2006/// UR - http://dx.doi.org/10.1145/1159803.1159834 ER -