Type-safe higher-order channels in ML-like languages factors for erosive oesophagitis and non-erosive reflux disease: a nationwide multicentre prospective study in Korea
SCIE
SCOPUS
- Title
- Type-safe higher-order channels in ML-like languages factors for erosive oesophagitis and non-erosive reflux disease: a nationwide multicentre prospective study in Korea
- Authors
- Park, S
- Date Issued
- 2007-09
- Publisher
- ASSOC COMPUTING MACHINERY
- Abstract
- As a means of transmitting not only data but also code encapsulated within functions, higher-order channels provide an advanced form of task parallelism in parallel computations. In the presence of mutable references, however, they pose a safety problem because references may be transmitted to remote threads where they are no longer valid. This paper presents an ML-like parallel language with type-safe higher-order channels. By type safety, we mean that no value written to a channel contains references, or equivalently, that no reference escapes via a channel from the thread where it is created. The type system uses a typing judgment that is capable of deciding whether the value to which a term evaluates contains references or not. The use of such a typing judgment also makes it easy to achieve another desirable feature of channels, channel locality, that associates every channel with a unique thread for serving all values addressed to it. Our type system permits mutable references in sequential computations and also ensures that mutable references never interfere with parallel computations. Thus it provides both flexibility in sequential programming and ease of implementing parallel computations.
- Keywords
- languages; higher-order channels; channel locality; parallel languages; distributed languages
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/26074
- DOI
- 10.1145/1291220.1291181
- ISSN
- 0269-2813
- Article Type
- Article
- Citation
- ACM SIGPLAN NOTICES, vol. 42, no. 9, page. 191 - 202, 2007-09
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.