Re: Tree rewriting code generators

boyland@aspen.berkeley.edu (John Boyland)
Wed, 1 May 91 10:49:57 -0700

          From comp.compilers
Related articles
Tree rewriting code generators sseiden@ics.uci.edu (1991-04-27)
Re: Tree rewriting code generators mwb3092@cs.rit.edu (1991-05-01)
Re: Tree rewriting code generators boyland@aspen.berkeley.edu (1991-05-01)
Re: Tree rewriting code generators sja@sirius.hut.fi (Sakari Jalovaara) (1991-05-03)
Re: Tree rewriting code generators pardo@june.cs.washington.edu (1991-05-03)
Re: Tree rewriting code generators pardo@june.cs.washington.edu (1991-05-06)
| List of all articles for this month |
Newsgroups: comp.compilers
From: boyland@aspen.berkeley.edu (John Boyland)
Keywords: code, optimize
Organization: Compilers Central
References: <9104271611.aa07675@ics.uci.edu>
Date: Wed, 1 May 91 10:49:57 -0700

|> 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)
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.