Abstract

ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 869-0481, or permissions@acm.org. 2 \Delta P. Wickline, P. Lee, F. Pfenning, and R. Davies type poly = int list; (* val evalPoly : int * poly -? int *) fun evalPoly (x, nil) = 0 --- evalPoly (x, a::p) = a + (x * evalPoly (x, p)); If this function were called many times with the same polynomial but different bases, it might be profitable to specialize it to the particular polynomial, in effect synthesizing a function that directly computes the polynomial rather than interpreting its list representation. One way that we can accomplish this is by transforming the code as follows. (* val specPoly : poly -? int -? int *) fun specPoly (nil) = (fn x =? 0) --- specPoly (...

Citations