Theory and practice of sequential algorithms: the kernel of the applicative language CDS
Algebraic methods in semantics
The definition of Standard ML
Introduction to algorithms
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Interdefinability of parallel operations in PCF
Theoretical Computer Science - Special issue: Part B: Logic, semantics, and theory of programming
About primitive recursive algorithms
Selected papers of the 16th international colloquium on Automata, languages, and programming
Towards a theory of parallel algorithms on concrete data structures
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Fully abstract semantics for observably sequential languages
Information and Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A Loop-Detecting Interpreter for Lazy, Higher-Order Programs
Proceedings of the 1992 Glasgow Workshop on Functional Programming
Programming with concrete data structures and sequential algorithms
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
A Representation Theorem for Primitive Recursive Algorithms
Fundamenta Informaticae
| Hi-index | 0.00 |
We call language L1 intensionally more expressive than L2 if there are functions which can be computed faster in L1 than in L2. 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 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 negative. We show that CDSP is more expressive intensionally than CDS0. We also study three parallel extensions to PCF: parallel-or (por) and parallel conditionals on booleans (pif&ogr;) and integers (pif&igr;). The situation is more complicated there: pif&igr; is still more expressive than both pif&ogr; and por. However, pif&igr; still is not as expressive as the deterministic query construct of CDSP. Thus, we identify a hierarchy of intensional expressiveness for deterministic parallelism.