|
|
|
|
|
by jorkingit
384 days ago
|
|
It should be! e.g. if every function takes a continuation as its final argument, then: call/cc& = \f. \k. f k k
Then in f you can invoke the continuation k as many times as you want, but that does involve a whole program transformation to CPS. |
|
Still, doesn't it throw the de bruijn indexes off? Or am I wrong about that as well?
Lambda calculus makes my head hurt.