context: I'm currently writing a small scheme compiler and took the approach of first transforming into administrative normal form and then into cps (I find this to be the easiest to understand, since there is a clear seperation in what they do).
the question: CPS uses continuations only for non-primitives and not for primitives. I really don't understand the connection between this and being able to correctly desugar call/cc and the likes. Wouldn't it be enough to simply create a lambda for each call/cc, which represents the continuation? Why are we using continuations for all the non-primives / Have I wrongly assumed CPS being a necessity to be able to desugar call/cc?
example:
(+ 2 (call/cc (lambda (k) (k 2))))
becomes (anf)
(let ((v1 (call/cc (lambda (k) (k 2)))))
(+ 2 v1))
becomes (continution for call/cc as well as its desugaring)
((λ (f cc) (f (λ (x _) (cc x)) cc)) (lambda (k cont) (k 2))
(lambda (v1) ((lambda (x) (display-or-whatever x)) (+ 2 v1)))))
I'd assume this approach generally works.