peephole optimizaiton

[ValdemarGr]

The step algebra should be able to be optimized by running a peephole algorithm.

Keep removing redundant expressions (Compose(Lift(f), Lift(g)) => Lift(f andThen g)) a'la chris okasaki's red-black tree rotations or someting similar. This can even have an impact on the semantics for choice, opening up new batching opportunities!

• Lift -> Effect -> Lift => Lift -> Effect if we have Functor.
• Lift -> Effect -> Lift -> Effect => Lift -> Effect if we have Monad
• Lift -> Effect -> Lift -> Stream => Lift -> Stream with Stream.eval(fa).flatMap(...)
• Lift -> ... -> Arg => Arg since inputs can safely be ignored, same with any input ignoring combinators.

[ValdemarGr]

Unfortunately the program looks different (toString for debugging) after optimizing which can hurt debugging.

[ValdemarGr]

Lifting identity functions as an explicit step should prove useful