Fri, 11 Nov 1994 10:02:07 GMT

Related articles |
---|

nuances of Copy Propagation? johnmce@world.std.com (1994-11-03) |

nuances of Copy Propagation? (& Lambda Calculus) mark@omnifest.uwm.edu (1994-11-07) |

Re: nuances of Copy Propagation? (& Lambda Calculus) steck@dcs.ed.ac.uk (Paul Steckler) (1994-11-11) |

Newsgroups: | comp.compilers |

From: | Paul Steckler <steck@dcs.ed.ac.uk> |

Keywords: | optimize |

Organization: | Department of Computer Science, University of Edinburgh |

References: | 94-11-028 94-11-049 |

Date: | Fri, 11 Nov 1994 10:02:07 GMT |

mark@omnifest.uwm.edu (Mark Hopkins) writes:

*>The best way to answer questions involving this is to realise that*

*>transformation rules in imperative languages are really consequences of*

*>the one rule of the Lambda Calculus: beta reduction. For the following*

*>discussion, think of this sequence as being following by some context*

*>involving the variables, to be denoted as follows:*

In my thesis, I showed how to do copy propagation *in*

(a version of) the lambda calculus. See:

ftp.ccs.neu.edu:/pub/people/steck/thesis.ps.Z

and the chapter called Ultra-beta.

-- Paul

| Paul Steckler | World-Wide Web: |

| steck@dcs.ed.ac.uk | URL = http://www.dcs.ed.ac.uk/home/steck |

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.