GitHub - 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.

prabh-t / ralist Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

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.

www.macs.hw.ac.uk/~pt114/msc-thesis/

1 star 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
ParPerfComparison.hs		ParPerfComparison.hs
ParTree.hs		ParTree.hs
RAList.hs		RAList.hs
README		README
SeqPerfComparison.hs		SeqPerfComparison.hs
StdList.hs		StdList.hs