prabh-t

ralist

Alternative representation of Haskell's widely used list data structure based on Chris Okasaki's implementation of random-access list. This representation is intended to expose parallelism using a structure built around trees which is better suited for parallel processing.

concurrent-skiplist

An implementation of maps and sets based on a concurrent-skiplist implementation.

haskell-lockfree

A collection of different packages for CAS based data structures.

lvars

A collection of prototype LVar implementations, tools, and mechanized semantics.

monad-par

nbody

Implementations of the nbody problem in a number of languages, including Haskell, F# and Scala

parconc-examples

Sample code to accompany the book "Parallel and Concurrent Programming in Haskell"

pardata

A number of advanced evaluation strategies for tree-like data structures.

prabh-t.github.io

Prabh T's website

VELASSCO

velassco platform codes

www