Seq no more

Marlow, Simon; Maier, Patrick; Loidl, Hans-Wolfgang; Aswad, Mustafa; Trinder, Phil

doi:10.1145/1863523.1863535

Cited by 99 publications

(72 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After all, we divided the list in two, and we know the sample input has an even number of problems. The reason for the unevenness is that each problem does not take the same amount of time to solve, it all depends on the searching strategy used by the Sudoku solver 9 . This illustrates an important distinction between two partitioning strategies:…”

Section: Basic Parallelism: the Eval Monadmentioning

confidence: 99%

“…Concurrent Haskell [11] is an extension to Haskell 2010 [9] adding support for explicitly threaded concurrent programming. The basic interface remains largely unchanged in its current implementation, although a number of embellishments have since been added, which we will cover in later sections:…”

Section: Concurrent Haskellmentioning

confidence: 99%

“…We call the latter kind an asynchronous exception, for obvious reasons. (We do not review the Haskell support for synchronous exceptions here; for that see the Haskell 2010 report [9] and the documentation for the Control.Exception module).…”

Section: Onexception :: Io a -> Io B -> Io Amentioning

confidence: 99%

“…Haskell has a foreign function interface (FFI) that allows Haskell code to call, and be called by, foreign language code (primarily C) [9]. Foreign languages also have their own threading models -in C there is POSIX or Win32 threads, for example -so we need to specify how Concurrent Haskell interacts with the threading models of foreign code.…”

Section: Concurrency and The Foreign Function Interfacementioning

confidence: 99%

“…Full details on the syntax of foreign declarations and the relationship between C and Haskell types can be found in the Haskell report [9]. Just as Haskell threads run concurrently with each other, when a Haskell thread makes a foreign call, that foreign call runs concurrently with the other Haskell threads, and indeed with any other active foreign calls.…”

Section: Concurrency and The Foreign Function Interfacementioning

confidence: 99%

See 4 more Smart Citations

Parallel and Concurrent Programming in Haskell

Marlow

2012

Central European Functional Programming School

Self Cite

View full text Add to dashboard Cite

Abstract. Haskell provides a rich set of abstractions for parallel and concurrent programming. This tutorial covers the basic concepts involved in writing parallel and concurrent programs in Haskell, and takes a deliberately practical approach: most of the examples are real Haskell programs that you can compile, run, measure, modify and experiment with. We cover parallel programming with the Eval monad, Evaluation Strategies, and the Par monad. On the concurrent side, we cover threads, MVars, asynchronous exceptions, Software Transactional Memory, the Foreign Function Interface, and briefly look at the construction of high-speed network servers in Haskell.

show abstract

Section: Basic Parallelism: the Eval Monadmentioning

confidence: 99%

Section: Concurrent Haskellmentioning

confidence: 99%

Section: Onexception :: Io a -> Io B -> Io Amentioning

confidence: 99%

Section: Concurrency and The Foreign Function Interfacementioning

confidence: 99%

Section: Concurrency and The Foreign Function Interfacementioning

confidence: 99%

See 3 more Smart Citations

Parallel and Concurrent Programming in Haskell

Marlow

2012

Central European Functional Programming School

Self Cite

View full text Add to dashboard Cite

show abstract

Parallel Haskell implementations of the N‐body problem

Totoo

Loidl

2013

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

SUMMARYThis paper provides an assessment of high-level parallel programming models for multi-core programming by implementing two versions of the n-body problem. We compare three different parallel programming models based on parallel Haskell, differing in the ways how potential parallelism is identified and managed. We assess the performance of each implementation, discuss the sequential and parallel tuning steps leading to the final versions, and draw general conclusions on the suitability of high-level parallel programming models for multi-core programming. We achieve speed-ups of up to 7.2 for the all-pairs algorithm and up to 6.5 for the Barnes-Hut algorithm on an 8-core machine.

show abstract

Intrinsic Currying for C++ Template Metaprograms

Keir

Gozillon

Haeri

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

C++ template metaprogramming is a form of strict functional programming, with a notable absence of intrinsic support for elementary higher-order operations. We describe a variadic template metaprogramming library which offers a model of implicitly curried, leftassociative metafunction application through juxtaposition; inspired by languages such as Haskell, OCaml and F. New and existing traits and metafunctions, constructed according to conventional idioms, seemlessly take advantage of the framework's features. Furthermore, a distinctive versatility is exposed, allowing a user to define higher-order metafunction classes using an equational definition syntax; without recourse to elaborate nested metafunctions. The primary type expression evaluator of the library is derived from a single application of an elementary folding combinator for type lists. The definition of the fold's binary operator argument is therefore a focal point; and constructed mindful that substitution failure of a template parameter's deduced type produces no compilation error. Two distinctive features of C++ metafunctions require particular consideration: zero argument metafunctions; and variadic metafunctions. We conclude by demonstrating characteristics of the library's main evaluation metafunction in conjunction with the universal property of an updated right-fold combinator, to compose a range of metafunctions including map, reverse, left-fold, and the Ackermann function.

show abstract

Seq no more

Cited by 99 publications

References 17 publications

Parallel and Concurrent Programming in Haskell

Parallel and Concurrent Programming in Haskell

Parallel Haskell implementations of the N‐body problem

Intrinsic Currying for C++ Template Metaprograms

Contact Info

Product

Resources

About