Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness (1995)
| Venue: | Proc. ACM Symposium on Principles of Programming Languages |
| Citations: | 8 - 4 self |
BibTeX
@INPROCEEDINGS{Brookes95sequentialalgorithms,,
author = {Stephen Brookes and Denis Dancanet},
title = {Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness},
booktitle = {Proc. ACM Symposium on Principles of Programming Languages},
year = {1995},
pages = {13--24}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We call language L 1 intensionally more expressive than L 2 if there are functions which can be computed faster in L 1 than in L 2 . We study the intensional expressiveness of several languages: the Berry-Curien programming language of sequential algorithms, CDS0, a deterministic parallel extension to it, named CDSP, and various parallel extensions to the functional programming language PCF. The paper consists of two parts. In the first part, we show that CDS0 can compute the minimum of two numbers n and p in unary representation in time O(min(n; p)). However, it cannot compute a "natural" version of this function. CDSP allows us to compute this function, as well as functions like parallel-or. This work can be seen as an extension of the work of Colson [7, 8] with primitive recursive algorithms to the setting of sequential algorithms. In the second part, we show that deterministic parallelism adds intensional expressiveness, settling a "folk" conjecture from the literature in the nega...
