composing programs with multithreading, events and distributed computing

Version on this page:0.5.4
LTS Haskell 19.8:
Stackage Nightly 2022-05-27:
Latest on Hackage:

See all snapshots transient appears in

MIT licensed by Alberto G. Corona
Maintained by
This version can be pinned in stack with:transient-0.5.4@sha256:42e1b0caab8e7aa567c9dda96fcbdd32dbf79f5afed05f6614060dbd1c6b86a8,1487

Module documentation for 0.5.4

  • Transient
    • Transient.Backtrack
    • Transient.Base
    • Transient.EVars
    • Transient.Indeterminism
    • Transient.Internals
    • Transient.Logged

Transient logo

Hackage Stackage LTS Stackage Nightly Build Status Gitter

NOTE: distributed computing and web primitives have been moved to transient-universe and ghcjs-hplay

Some feedback on transient:

  1. Rahul Muttineni @rahulmutt nov. 09 2016 03:40 Lead developper of ETA (the JVM Haskell compiler)

    It’s a bit mind bending in that it’s like using a higher-level list monad, but it’s very, very cool. For beginning Haskellers, what would be really useful is a visualisation of what happens when you do various distributed/parallel stuff. It’s almost shocking how effortlessly you can run computations across threads/nodes.

    The cool part is the composability in the distributed setting. You can make higher-order monadic functions that allow you to compose & reuse a long chain of distributed transactions via wormhole and teleport. Another benefit is that the transaction becomes first class and you can see exactly what’s going on in one place instead of distributing the logic across actors making the code equivalent to event callbacks, as you’ve stated.

What is Transient?

One of the dreams of software engineering is unrestricted composability.

This may be put in these terms:

let ap1 and ap2 two applications with arbitrary complexity, with all effects including multiple threads, asynchronous IO, indeterminism, events and perhaps, distributed computing.

Then the combinations:

 - ap1 <|> ap2          -- Alternative expression
 - ap1 >>= \x -> ap2    -- monadic sequence
 - ap1 <> ap2           -- monoidal expression
 - (,) <$> ap1 <*> ap2  -- Applicative expression

are possible if the types match, and generate new applications that are composable as well.

Transient does exactly that.

The operators <$> <*> and <> express concurrency, the operator <|> express parallelism and >>= for sequencing of threads and/or distributed processes. So even in the presence of these effects and others, everything is composable.

For this purpose transient is an extensible effects monad with all major effects and primitives for parallelism, events, asynchronous IO, early termination, non-determinism logging and distributed computing. Since it is possible to extend it with more effects without adding monad transformers, the composability is assured.


The Wiki is more user oriented

My video sessions in not intended as tutorials or presentations, but show some of the latest features running.

The articles are more technical:

These articles contain executable examples (not now, since the site no longer support the execution of haskell snippets).