000125992 001__ 125992
000125992 005__ 20190316234325.0
000125992 02470 $$2ISI$$a000256666800009
000125992 037__ $$aCONF
000125992 245__ $$aImplementing Joins using Extensible Pattern Matching
000125992 269__ $$a2008
000125992 260__ $$bSpringer$$c2008
000125992 336__ $$aConference Papers
000125992 490__ $$aLecture Notes in Computer Science$$v5052
000125992 520__ $$aJoin 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.
000125992 6531_ $$aConcurrent Programming
000125992 6531_ $$aJoin Patterns
000125992 6531_ $$aChords
000125992 6531_ $$aActors
000125992 700__ $$0240993$$g172057$$aHaller, Philipp
000125992 700__ $$aVan Cutsem, Tom
000125992 7112_ $$dJune 4-6, 2008$$cOslo, Norway$$a10th International Conference on Coordination Models and Languages
000125992 773__ $$tProceedings of the 10th International Conference on Coordination Models and Languages$$q135-152
000125992 8564_ $$uhttp://discotec08.ifi.uio.no/Coordination08/HomePage$$zURL
000125992 8564_ $$uhttps://infoscience.epfl.ch/record/125992/files/HallerVanCutsem08JoinsExtensiblePatternMatching.pdf$$zn/a$$s376415
000125992 909C0 $$xU10409$$0252187$$pLAMP
000125992 909CO $$ooai:infoscience.tind.io:125992$$qGLOBAL_SET$$pconf$$pIC
000125992 937__ $$aLAMP-CONF-2008-003
000125992 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000125992 980__ $$aCONF