Documentation

Finally I can define seq directly! :-)

Note that this function is less powerful than GHC's seq, since STG does not have a rule to force functions, only expressions that reduce to an algebraic or primitive value. This leads to the fact that STG's seq is less powerful than Haskell's, since in Haskell

seq (const ()) () = ()

whereas in the STG

constUnit = (x) -> Unit ();
seq (constUnit, Unit) = ERROR

Identity function.

id : a -> a

Constant function.

Const : a -> b -> a

Function composition.

compose : (b -> c) -> (a -> b) -> a -> c

The fixed point combinator.

fix : (a -> a) -> a