Loading...
Please wait, while we are loading the content...
S : an Implicitly Parallel -calculus with Recursive Bindings, Synchronization and Side Eeects Computation Structures Group Memo 393-2 S : an Implicitly Parallel -calculus with Recursive Bindings, Synchronization and Side Eeects
| Content Provider | Semantic Scholar |
|---|---|
| Author | Maessen, Jan-Willem Nikhil, R. S. |
| Copyright Year | 2007 |
| Abstract | S extends the-calculus with recursive bindings, barriers, and updatable memory cells with synchronized operations. The calculus can express both deterministic and nondeterministic computations. It is designed to be useful for reasoning about compiler optimizations and thus allows reductions anywhere, even inside 's. Despite the presence of side eeects, the calculus retains ne-grained, implicit parallelism and non-strict functions: there is no global, sequentializing store. Barriers, for sequencing, capture a robust notion of termination. Although S was developed as a foundation for the parallel functional languages pH and Id, we believe that barriers give it wider applicability|to sequential, explicitly parallel and concurrent languages. In this paper we describe the S-calculus and its properties, based on a notion of observable information in a term. We also describe reduction strategies to compute maximal observable information even in the presence of unbounded nondeterminism. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.lcs.mit.edu/publications/pubs/ps/MIT-LCS-TM-393-2.ps.gz |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
