@techreport{R-85-08,
TITLE = {RELATING LOGIC PROGRAMS AND ATTRIBUTE GRAMMARS
(Revised version)},
AUTHOR = {Pierre Deransart and Jan Maluszynski},
YEAR = {1985},
NUMBER = {R-85-08},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-85-08+abstr},
ABSTRACT = {This paper shows that logic programs and attribute grammars are closely related. Constructions are given which transform logic programs into semantically equivalent attribute grammars, and vice versa. This opens for application in logic programming of some methods developed for attribute grammars. These results are used to find a sufficient condition under which no infinite term can be created during a computation of a logic program, and to define a nontrivial class of logic programs which can be run without employing unification in its general form.},
IDANR = {LiTH-IDA-R-85-08},
NOTE = {Revised version (LiTH-IDA-R.84-07) Also in Journal of Logic Programming}