Felleisen, Matthias2009-06-042009-06-041989Arbilla, Laura. "A correspondence between Scheme and the lambda(,upsilon)-CS-calculus." (1989) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/13340">https://hdl.handle.net/1911/13340</a>.https://hdl.handle.net/1911/13340We study the relationship between the programming language Scheme and the $\lambda\sb{v}$-CS-calculus. To this end, we define a correspondence between Scheme and $\Lambda\sb{CS}$-terms--the language of the calculus--where every Scheme term is an abbreviation of a $\Lambda\sb{CS}$-term. Although Scheme and $\Lambda\sb{CS}$ 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 $\Lambda\sb{CS}$ 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 $\Lambda\sb{CS}$, and provides a formal basis for the development and formal investigation of an object-oriented extension of Scheme.58 p.application/pdfengCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.Computer scienceThesisThesis Comp. Sci. 1989 Arbilla