We study the relationship between the programming language Scheme and the λ\sbv-CS-calculus. To this end, we define a correspondence between Scheme and Λ\sbCS-terms--the language of the calculus--where every Scheme term is an abbreviation of a Λ\sbCS-term. Although Scheme and Λ\sbCS have constructs that roughly correspond to each other, the relationship is rather complex: the inclusion of domain predicates in Scheme enforces the uniform treatment of all values in Scheme as procedural abstractions. Therefore, we must conclude that Λ\sbCS cannot express Scheme as a notational definition, but only simulate it through a translation. On the other hand, the embedding reveals Scheme's object-oriented nature relative to Λ\sbCS, and provides a formal basis for the development and formal investigation of an object-oriented extension of Scheme.