http://www.panxingzhi.net/in-respect-to-lifting-in-flapjax/

I do miss the compiler a little though.

I’m glad you enjoyed the talk! The actual implementation of Flapjax is past my (facile) description, and it’s worth taking a look at — it’s moderately documented throughout. Some of the implementation checks the graph to prevent glitchy behaviors in cycles. There might be more examples of using “graph knowledge”, but I’m not quite sure what you mean.

The operation is called lifting because it promotes a function on “ordinary values” to a function on event streams — have a look at Haskell documentation on liftM.

As for the compiler and the language, I agree with you. The library is definitely the way to go.

Why is it called “lifting”? lift_e takes an event stream, not an “ordinary value”, so it is not really “lifting”…

What does Flapjax do with the graph knowledge about events and behaviors?

As a side note, I think that the Flapjax compiler is a really nifty trick, but I would shy away from using it (it adds another layer). Flapjax – the library – is more appealing to me.