Hello, I hadn't programmed for some time, so as review I worked through “The Little Schemer” over the last seven days. I've been attempting to contextualize some of the knowledge I've gained from that book. For example Y-combinator seems to be a function which results in the repeated partial evaluation of a function onto its self. I'm struggling a bit to contextualize CPS as mentioned in Chapter 8 though. I understand the concept, just not how it relates to other ideas presented .
In some ways it seems like the inverse of repeated partial evaluation on its self (recursion). Instead of perpetually applying a function to its self a new function is generated by repeatedly adding new arguements on top of every application. Are they actually inverses of one another, can every recursion on a continuation be represented without either? What even is the natural recursion on a continuation?