stc-lang: A library for implicit, monadic dataflow parallelism

[ bsd3, concurrency, development, library, program ] [ Propose Tags ]


  • Control
    • Monad
      • Control.Monad.Generator
      • Control.Monad.SD
      • Control.Monad.Stream
        • Control.Monad.Stream.Chan
        • Control.Monad.Stream.Par
        • Control.Monad.Stream.PinnedChan
  • Data
    • Data.Dynamic2
    • Data.StateElement
  • Type
    • Type.Magic


Manual Flags


Enable the debuggable scheduler


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 1.0.0
Dependencies abstract-par (>=0.3.3), aeson (>=, base (>=4.7 && <5), BoundedChan (>=, bytestring (>=, clock (>=0.7.2), deepseq (>=, hashable (>=, hashtables (>=, hedis (>=0.9.12), hw-kafka-client (>=2.6.0), microlens (>=, microlens-aeson (>=, monad-par (>=, monad-par-extras (>=0.3.3), mtl (>=2.2.1), random (>=1.1), stc-lang, text (>=, transformers (>=, uuid-types (>=1.0.3), vector (>=, yaml (>=0.8.28) [details]
License BSD-3-Clause
Copyright 2017-2019 Norman Rink, Sebastian Ertel, Justus Adam
Author Norman Rink, Sebastian Ertel, Justus Adam
Revised Revision 1 made by justus at 2019-08-01T12:03:20Z
Category Concurrency, Development
Home page
Source repo head: git clone
Uploaded by justus at 2019-08-01T11:58:19Z
Executables ohua-stream-bench
Downloads 506 total (4 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2019-08-01 [all 3 reports]

Readme for stc-lang-1.0.0

[back to package description]

STCLang: A library for implicit monadic dataflow parallelism

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.


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

A link to the publication will appear here once we have one, e.t.a. is 22th of August (date of the conference). Should it be after this date now, but there's still no link, I probably forgot. In that case open an issue, shoot me an email or tweet me @justusadam_.