Change search
ReferencesLink to record
Permanent link

Direct link
Implementing Joins Using Extensible Pattern Matching
EPFL, Switzerland.ORCID iD: 0000-0002-2659-5271
Vrije Universiteit Brussel, Belgium.
2008 (English)In: COORDINATION 2008: Proceedings of the 10th International Conference on Coordination Models and Languages, 2008, 135-152 p.Conference paper (Refereed)
Abstract [en]

Join patterns are an attractive declarative way to synchronize both threads and asynchronous distributed computations. We explore joins in the context of extensible pattern matching that recently appeared in languages such as F# and Scala. Our implementation supports join patterns with multiple synchronous events, and guards. Furthermore, we integrated joins into an existing actor-based concurrency framework. It enables join patterns to be used in the context of more advanced synchronization modes, such as future-type message sending and token-passing continuations.

Place, publisher, year, edition, pages
2008. 135-152 p.
National Category
Computer Science
URN: urn:nbn:se:kth:diva-165589DOI: 10.1007/978-3-540-68265-3_9ISI: 000256666800009ScopusID: 2-s2.0-45749106753OAI: diva2:808628
2008 International Conference on Coordination Models and Languages, Oslo, Norway, June 4-6, 2008

QC 20150505

Available from: 2015-04-29 Created: 2015-04-29 Last updated: 2015-05-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Haller, Philipp
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 11 hits
ReferencesLink to record
Permanent link

Direct link