stc-lang alternatives and similar packages
Based on the "Concurrency" category.
Alternatively, view stc-lang alternatives based on common mentions on social networks and blogs.
-
haxl
A Haskell library that simplifies access to remote data, such as databases or web-based services. -
streamly
High performance, concurrent functional programming abstractions -
chaselev-deque
A collection of different packages for CAS based data structures. -
unagi-chan
A haskell library implementing fast and scalable concurrent queues for x86, with a Chan-like API -
libcspm
The library FDR3 uses for parsing, type checking and evaluating machine CSP. -
cspmchecker
The library FDR3 uses for parsing, type checking and evaluating machine CSP. -
lifted-async
Run lifted IO operations asynchronously and wait for their results -
threads-supervisor
Simple, IO-based Haskell library for Erlang-inspired thread supervisors -
concurrent-machines
Concurrency features for the Haskell machines package -
concurrent-supply
A fast globally unique variable supply with a pure API -
sirkel
Sirkel; a Chord DHT in haskell. Node failure, replication and batteries included! -
slave-thread
A principal solution to ghost threads and silent exceptions -
thread-supervisor
A simplified implementation of Erlang/OTP like supervisor for GHC thread -
timers
Simple package that implements timers. Both "one-shot" and "repeating" timers are implemented. -
split-channel
Control.Concurrent.Chan split into sending and receiving halves. -
token-bucket
Haskell rate limiter library using lazy token bucket algorithm -
unagi-bloomfilter
A fast, cache-efficient, concurrent bloom filter in Haskell
Clean code begins in your IDE with SonarLint
Do you think we are missing an alternative of stc-lang or a related project?
README
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.
Publication
We documented the principles in this library in a paper at the Haskell Symposium 2019.
- DOI Paper link: https://doi.org/10.1145/3331545.3342600
- Direct link to PDF: https://ohua-dev.github.io/papers/stc-lang.pdf
- Slides for the presentation at Haskell'19: https://ohua-dev.github.io/slides/haskell-19-stclang.pdf
- Entry in our bibliography: https://ohua-dev.github.io/bib/#stclang-state-thread-composition-as-a-foundation-for-monadic-dataflow-parallelism
*Note that all licence references and agreements mentioned in the stc-lang README section above
are relevant to that project's source code only.