This paper presents the final result of the designing of a new specification for the Haskell# Language, including new features to increase its expressiveness, but without losing either efficiency or obedience to its original premisses
This paper introduces HaskSkel: an implementation of algorithmic skeletons for the non-strict functi...
To provide high performance at practical power levels, tomorrow’s chips will have to consist primari...
John Hughes [10] argues that the ability to decompose a problem into parts, depends upon the ability...
It has often been suggested that functional languages provide an excellent basis for programming par...
It has long been known that some of the most common uses of for and while-loops in imperative progra...
Nowadays, performance in processors is increased by adding more cores orwider vector units, or by co...
We introduce a pure functional programming language, Haskell. We discuss the advantages of the Haske...
This dissertation presents pHc, a new compiler for Parallel Haskell (pH) with complete support for t...
Nowadays, performance in processors is increased by adding more cores or wider vector units, or by c...
This thesis contains a description of an implementation of an extended subset of the programming lan...
We present a complete redesign of evaluation strategies, a key ab-straction for specifying pure, det...
<p>With the emergence of commodity multicore architectures, exploiting tightly-coupled paralle...
<p>We present a complete redesign of evaluation strategies, a key abstraction for specifying p...
This paper describes a high level operational semantics for a simple programming language, called K ...
MPP Haskell is a parallel implementation of the lazy purely-functional language Haskell for the Thin...
This paper introduces HaskSkel: an implementation of algorithmic skeletons for the non-strict functi...
To provide high performance at practical power levels, tomorrow’s chips will have to consist primari...
John Hughes [10] argues that the ability to decompose a problem into parts, depends upon the ability...
It has often been suggested that functional languages provide an excellent basis for programming par...
It has long been known that some of the most common uses of for and while-loops in imperative progra...
Nowadays, performance in processors is increased by adding more cores orwider vector units, or by co...
We introduce a pure functional programming language, Haskell. We discuss the advantages of the Haske...
This dissertation presents pHc, a new compiler for Parallel Haskell (pH) with complete support for t...
Nowadays, performance in processors is increased by adding more cores or wider vector units, or by c...
This thesis contains a description of an implementation of an extended subset of the programming lan...
We present a complete redesign of evaluation strategies, a key ab-straction for specifying pure, det...
<p>With the emergence of commodity multicore architectures, exploiting tightly-coupled paralle...
<p>We present a complete redesign of evaluation strategies, a key abstraction for specifying p...
This paper describes a high level operational semantics for a simple programming language, called K ...
MPP Haskell is a parallel implementation of the lazy purely-functional language Haskell for the Thin...
This paper introduces HaskSkel: an implementation of algorithmic skeletons for the non-strict functi...
To provide high performance at practical power levels, tomorrow’s chips will have to consist primari...
John Hughes [10] argues that the ability to decompose a problem into parts, depends upon the ability...
DOI
Add to ORKG