### Simplifying, Serializing and Lifting

Today I made a little progress on my CPS transformer for lambda-terms. I can now "simplify" terms (because the CPS'd terms have lots of unneccessary lambda-abstractions) and serialize them. In principle I should be able to serialize the continuations, even though they're not yet defunctionalized, and thereby gain a little clarity on this.

The non-strict evaluation order is still dogging me. I have these terms where the important part is buried in the middle, and won't be forced by anything in my system. This is why I say "in principle." I am getting a term that has "print c" in the middle where c is a continuation, but I'm having trouble forcing evaluation of that.

I read up on lambda-lifting today; the only general resource was the FOLDOC description.