The point of this paper is to describe a challenging application of algebraic methods to programming language theory. Much work on the theory of Scheme–like languages (applicative, but not necessarily functional) has an essentially algebraic flavor [Talcott 1985] [Felleisen, Wand,et.al. 1988]. Thus it seems appropriate to make the algebraic aspect explicit. This would allow us to take advantage of the work in algebraic methods to extend and generalize existing work and to facilitate application of the results. Full support of this application of algebraic methods will require bringing diverse results together in a single enriched framework.