Wesselkamper, Thomas C.Nixon, Eric2013-06-192013-06-191973http://hdl.handle.net/10919/20240This paper defines a data space whose points are trees with leaves which are [name,value] pairs. Over this space a substitution operator S (meaning informally "in x for y put z") is formally defined. Taken together with several auxiliary operators, S is shown to be sufficient to define a large class of high-level languages since S is known to be functionally complete for finite-valued spaces, a functionally complete language is exhibited.application/pdfenIn CopyrightTechnical reportCS73002-Rhttp://eprints.cs.vt.edu/archive/00000741/01/CS73002-R.pdf