We show that lambda abstractions can be transformed into continuations with several interesting characteristics:
•
• Continuations could serve as the basis of a Scheme-like language, called Scheme-λ1.
•
• The transformation is analogous to the continuation-passing style transformation.
•
• Several programming-language concepts emerge as results of the transformation.
•
• Everything that can be represented as a lambda abstraction can now be represented as a continuation.
•
• The transformation is simple and sound.
Our work would not be complete if the macro facility were not taken into account. Thus, we show how to embed Scheme-λ1 in Scheme so as to accommodate the macro facility.
