A Parallel Programming Style Export

@misc{citeulike:1146682, abstract = {We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The primitive program schemes (called tropes) take the form of parameterised conditional rewrite rules, and the computational model is a variant of the Gamma style, in which computation proceeds by nondeterministic local rewriting of a global multiset.}, author = {Algebra, And I.}, citeulike-article-id = {1146682}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.7245}, keywords = {algebra, functional, parallel, rules, thesis}, posted-at = {2007-03-08 08:31:04}, priority = {2}, title = {A Parallel Programming Style}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.7245} }

TY - GEN ID - citeulike:1146682 L3 - citeulike-article-id:1146682 N2 - We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The primitive program schemes (called tropes) take the form of parameterised conditional rewrite rules, and the computational model is a variant of the Gamma style, in which computation proceeds by nondeterministic local rewriting of a global multiset. TI - A Parallel Programming Style KW - algebra KW - functional KW - parallel KW - rules KW - thesis AU - Algebra, And UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.7245 ER -