Modern concurrency abstractions for C#
Top Cited Papers
- 1 September 2004
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 26 (5) , 769-804
- https://doi.org/10.1145/1018203.1018205
Abstract
Polyphonic C ♯ is an extension of the C ♯ language with new asynchronous concurrency constructs, based on the join calculus. We describe the design and implementation of the language and give examples of its use in addressing a range of concurrent programming problems.Keywords
This publication has 16 references indexed in Scilit:
- Service combinators for Web computingIEEE Transactions on Software Engineering, 1999
- Compiling Join-Patterns1 1This work is partly supported by the ESPRIT CONFER-2 WG-21836Electronic Notes in Theoretical Computer Science, 1998
- The reflexive CHAM and the join-calculusPublished by Association for Computing Machinery (ACM) ,1996
- A new exercise in concurrencyACM SIGCSE Bulletin, 1994
- Issues in the design of a parallel object-oriented languageFormal Aspects of Computing, 1989
- A parallel machine for multiset transformation and its programming styleFuture Generation Computer Systems, 1988
- An overview of the SR language and implementationACM Transactions on Programming Languages and Systems, 1988
- Viewing control structures as patterns of passing messagesArtificial Intelligence, 1977
- MonitorsCommunications of the ACM, 1974
- SIMULA: an ALGOL-based simulation languageCommunications of the ACM, 1966