Higher Order Combinators for Join Patterns using STM Export

@misc{citeulike:4130771, abstract = {Join patterns provide a higher level concurrent programming construct than the explicit use of threads and locks and have typically been implemented with special syntax and run-time support. This paper presents a strikingly simple design for a small number of higher order combinators which can be composed together to realize a powerful set of join patterns as a library in an existing language. The higher order combinators enjoy a lock free implementation that uses software transactional memory (STM). This allows joins patterns to be implemented simply as a library and provides a transformational semantics for join patterns. 1.}, author = {Singh, Satnam}, citeulike-article-id = {4130771}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.8435}, citeulike-linkout-1 = {http://dx.doi.org/10.1.1.83.8435}, doi = {10.1.1.83.8435}, keywords = {concurrency, pi-calculus, programming-language-design}, posted-at = {2009-03-04 00:38:49}, priority = {5}, title = {Higher Order Combinators for Join Patterns using STM}, url = {http://dx.doi.org/10.1.1.83.8435} }

TY - ELEC ID - citeulike:4130771 L3 - citeulike-article-id:4130771 N2 - Join patterns provide a higher level concurrent programming construct than the explicit use of threads and locks and have typically been implemented with special syntax and run-time support. This paper presents a strikingly simple design for a small number of higher order combinators which can be composed together to realize a powerful set of join patterns as a library in an existing language. The higher order combinators enjoy a lock free implementation that uses software transactional memory (STM). This allows joins patterns to be implemented simply as a library and provides a transformational semantics for join patterns. 1. TI - Higher Order Combinators for Join Patterns using STM KW - concurrency KW - pi-calculus KW - programming-language-design AU - Singh, Satnam UR - http://dx.doi.org/10.1.1.83.8435 ER -