Related articles |
---|
Partial evaluation in imperative languages. cef@geodesic.com (Charles Fiterman) (1997-05-30) |
Re: Partial evaluation in imperative languages. monnier+/news/comp/compilers@tequila.cs.yale.edu (Stefan Monnier) (1997-05-31) |
Re: Partial evaluation in imperative languages. cliffc@risc.sps.mot.com (Cliff Click) (1997-06-02) |
Re: Partial evaluation in imperative languages. cef@geodesic.com (Charles Fiterman) (1997-06-04) |
Re: Partial evaluation in imperative languages. volanski@irisa.fr (1997-06-10) |
From: | volanski@irisa.fr (Nic Volanski) |
Newsgroups: | comp.compilers,comp.lang.functional |
Date: | 10 Jun 1997 23:57:44 -0400 |
Organization: | IRISA, Campus de Beaulieu, 35042 Rennes Cedex, FRANCE |
References: | 97-05-322 |
Keywords: | optimize |
Charles Fiterman <cef@geodesic.com> writes:
>I think for partial evaluation to be useful in an imperative language
>there must be language constructs to support it.
I completely agree. There is already some work on this side. One can
basically distiguish two approaches:
1. Annotations within the program. The language is extended with
qualifiers like Charles F. described ('pure', 'run', etc.) This
direction is beeing explored by the Dynamic compilation prooject at
University of Washington (see:
http://www.cs.washington.edu/homes/matthai/www-dc/)
2. Separate declarations. A separate specification file is used to
declare partial evaluation opportunities corresponding to a given
program. This way, you can optimize the same program for different
contexts, without altering its source. This direction is being
explored in a paper to appear at OOPSLA'97 (see:
http://www.irisa.fr/EXTERNE/bibli/pi/1088/1088.html)
Nic.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.