README.md

sml-streams

The vision: Bulk memory operations with Standard ML in MLton. The pattern is based on pipelines that are composed via continuations, where a source is wrapped as a push-based stream, transformations are applied via lazy operations and eager combinators force the effects on the backing, in-memory collection of items:

source - lazy - lazy - lazy - eager

Test

To experiment with the library install MLton and make the project:

> sudo yum install mlton
> make bench
> cd build 
> ./bench-streams

Example

(* using F#-like pipe operators *)
Array.tabulate (10, fn i => i)
    |> Stream.ofArray
    |> Stream.map(fn x => x * x)
    |> Stream.take 6
    |> Stream.sum

Benchmarks

# Outer=1000000, Inner=10
Streams cart time: 0.098 sec/op
Baseline cart time: 0.048 sec/op

# Outer=5000000, Inner=50
Streams cart time: 1.857 sec/op
Baseline cart time: 1.195 sec/op

# Outer=10000000, Inner=100
Streams cart time: 7.151 sec/op
Baseline cart time: 4.723 sec/op

References

• Inspired by our work on Clash of the Lambdas
• Nessos/Streams in F#
• Lightweight Streams in Java (reimplemented with lambdas only)
• MLton
• Found out that similar pattern appears in MLton/Iterator combinators, iter.sml / iter.sig