Skip to content
Implicit monadic dataflow parallelism
Haskell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
benchmarks
src
stream-bench
test
.gitignore
.hindent.yaml
.travis.yml Using travis yaml for stack Aug 1, 2019
LICENSE
README.md
Setup.hs
package.yaml
stack.yaml

README.md

STCLang: A library for implicit monadic dataflow parallelism

Build Status Hackage GitHub Publication

STCLang is a library that enables stateful, implicit, monadic parallel computation in Haskell. The core ideas come from the ohua project.

STCLang lets you create parallel dataflows with stateful nodes without having to explicitly wire complex graph structures. Instead the program is written with an embedded, monadic DSL and automatically transformed into a graph and executed in parallel.

On top of the base abstraction we have also built an FRP (functional reactive programming) interface. This allows you to run reactive programs on sequential streams of values and leverage pipeline parallelism to peed up computation.

We also published the theory and concepts behind this library.

Publication

We documented the principles in this library in a paper at the Haskell Symposium 2019.

You can’t perform that action at this time.