Feedback
Higher-order concurrent programs with finite communication topology (extended abstract)
Full text
Pdf (1.09 MB)
Source
Annual Symposium on Principles of Programming Languages archiveProceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
Portland, Oregon, United States
Pages: 84 - 97
Year of Publication: 1994
ISBN:0-89791-636-0
Authors
Hanne Riis Nielson
Computer Science Department, Aarhus University, Denmark
Flemming Nielson
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1, Downloads (12 Months): 11, Citation Count: 27
Additional Information:
abstract references cited by index terms collaborative colleagues peer to peer
Tools and Actions:
Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark:
Use this link to bookmark this Article: http://doi.acm.org/10.1145/174675.174538What is a DOI?
ABSTRACT
Concurrent ML (CML) is an extension of the functional language Standard ML(SML) with primitives for the dynamic creation of processes and channels and for the communication of values over channels. Because of the powerful abstraction mechanisms the communication topology of a given program may be very complex and therefore an efficient implementation may be facilitated by knowledge of the topology. This paper presents an analysis for determining when a bounded number of processes and channels will be generated. The analysis proceeds in two stages. First we extend a polymorphic type system for SML to deduce not only the type of CML programs but also their communication behaviour expressed as terms in a new process algebra. Next we develop an analysis that given the communication behaviour predicts the number of processes and channels required during the execution of the CML program. The correctness of the analysis is proved using a subject reduction property for the type system.