Report or block prabhatt
Contact Support about this user's behavior.Report abuse
- Heriot-Watt University
- Joined on
Sep 13, 2011
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 …
A number of advanced evaluation strategies for tree-like data structures.
Forked from rrnewton/concurrent-skiplist
An implementation of maps and sets based on a concurrent-skiplist implementation.
Forked from rrnewton/haskell-lockfree
A collection of different packages for CAS based data structures.
Forked from iu-parfunc/lvars
A collection of prototype LVar implementations, tools, and mechanized semantics.
Forked from simonmar/parconc-examples
Sample code to accompany the book "Parallel and Concurrent Programming in Haskell"