Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Staples:1980:SSR,
author = "J. Staples",
title = "Speeding up subtree replacement systems",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "1",
pages = "39--47",
month = may,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Math. and Computer Sci., Queensland Inst. of
Technol., Brisbane, Qld., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "correctness; graph like expressions; graph theory;
optimal evaluation algorithms; subtree replacement
systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}