Results 1 
1 of
1
Efficient Algebraic Operations on Programs
 University of Iowa
, 1991
"... A symbolic version of an operation on values is a corresponding operation on program texts. For example, symbolic composition of two programs p, q yields a program whose meaning is the (mathematical) composition of the meanings of p and q. Another example is symbolic specialization of a function to ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A symbolic version of an operation on values is a corresponding operation on program texts. For example, symbolic composition of two programs p, q yields a program whose meaning is the (mathematical) composition of the meanings of p and q. Another example is symbolic specialization of a function to a known first argument value. This operation, given the first argument, transforms a twoinput program into an equivalent oneinput program. Computability of both of these symbolic operations has long been established in recursive function theory [12,16]; the latter is known as Kleene's "smn" theorem, also known as partial evaluation. In addition to computability we are concerned with efficient symbolic operations, in particular applications of the two just mentioned to compiling and compiler generation. Several examples of symbolic composition are given, culminating in nontrivial applications to compiler generation [14], [18]. Partial evaluation has recently become the subject of conside...