Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Kennaway:1990:ITR,
author = "R. Kennaway",
title = "Implementing term rewrite languages in {Dactl}",
journal = j-THEOR-COMP-SCI,
volume = "72",
number = "2-3",
pages = "225--249",
day = "23",
month = may,
year = "1990",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sun Oct 25 13:16:00 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
conflocation = "Nancy, France; 21-25 March 1988",
conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre
et en Programmation (Colloquium on Trees in Algebra and
Programming)",
corpsource = "Sch. of Inf. Syst., East Anglia Univ., Norwich, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Dactl; evaluation strategy; functional language;
functional programming; graph rewriting; low-level
language; parallel machines; rewriting systems",
pubcountry = "Netherlands",
sponsororg = "AFCET; BCS; GI",
treatment = "T Theoretical or Mathematical",
}