CoPa: a Parallel Programming Language for Collections Export

@misc{citeulike:87021, abstract = {In this paper we propose a new framework for parallel processing of collections. We define a high-level language called CoPa for processing nested sets, bags, and sequences (a generalization of arrays and lists). CoPa includes most features found in query languages for object-oriented or object-relational databases, and has, in addition, a powerful form of recursion not found in query languages. CoPa has a formal declarative definition of parallel complexity, as part of its specification. We...}, author = {Suciu, Dan and Tannen, Val}, citeulike-article-id = {87021}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.2667}, keywords = {functional, query}, posted-at = {2005-02-02 22:10:45}, priority = {2}, title = {CoPa: a Parallel Programming Language for Collections}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.2667} }

TY - GEN ID - citeulike:87021 L3 - citeulike-article-id:87021 N2 - In this paper we propose a new framework for parallel processing of collections. We define a high-level language called CoPa for processing nested sets, bags, and sequences (a generalization of arrays and lists). CoPa includes most features found in query languages for object-oriented or object-relational databases, and has, in addition, a powerful form of recursion not found in query languages. CoPa has a formal declarative definition of parallel complexity, as part of its specification. We... TI - CoPa: a Parallel Programming Language for Collections KW - functional KW - query AU - Suciu, Dan AU - Tannen, Val UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.2667 ER -