Nam, Y., and Henschen, L. J., Compiling Linear Recursive Programs with List Structure in Prolog into Procedural Languages, Proc. COMPSAC90, Chicago, Ill., Nov. 1990 Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Programming Data Structures In Logic - Turpin (1992) (1 citation) (Correct)
....concerns those researchers who have tried to improve the execution efficiency of logic and applicative programming languages, especially those concerned with destructive update. Nikhil [51] and Miwelski [42] have both investigated destructive updates in the applicative framework. Nam and Henschen [46] turn a certain class of Prolog programs into procedural code. The research on constraint programming [5, 36, 64] largely investigates the efficient execution of certain classes of logic programs, though it is not always couched in these terms. Curiously, straddling both sides of the fence, ....
Nam, Y., and Henschen, L. J., Compiling Linear Recursive Programs with List Structure in Prolog into Procedural Languages, Proc. COMPSAC90, Chicago, Ill., Nov. 1990
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC