Newsgroups: comp.compilers
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!sdd.hp.com!decwrl!world!iecc!compilers-sender
From: boyland@aspen.berkeley.edu (John Boyland)
Subject: Re: Tree rewriting code generators
Message-ID: <9105011749.AA03895@aspen.Berkeley.EDU>
Keywords: code, optimize
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: boyland@aspen.berkeley.edu (John Boyland)
Organization: Compilers Central
References:  <9104271611.aa07675@ics.uci.edu>
Date: Wed, 1 May 91 10:49:57 -0700
Approved: compilers@iecc.cambridge.ma.us

|> 1) References to journal articles not listed below.

[6] 1.  E. Pelegri-Llopart and S. L. Graham, Optimal Code Generation for
Expression Trees: An Application of BURS Theory.  POPL 88, pp294-308

[BURS: bottom up [tree] rewrite system]

|> 2) Information about people/organizations working in this area.

Pelegri-Llopart and Farnum both worked with tree transformation systems
for compilation.  Farnum concentrated on optimization.  Their theses are
available as technical reports from UC Berkeley. (1988 and 1990
respectively).  Farnum continues to work in tree transformation systems.
(cfarnum@valhalla.wright.edu) I am currently working in the area for my
own research.

John
(boyland@sequoia.berkeley.edu)
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.