Kwon K., Nadathur G. and Wilson D.S. (1993): Implementing a notion of modules in the logic programming language Prolog. In: (Lamma and Mello, 1993), pp.359--393. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Multilevel Prolog Representation Of Strategies For.. - Bielikova, Navrat (1996) (Correct)
....units with transparent minimal interfaces has been responded by several authors. Separated logic databases are called modules (Clark and McCabe, 1984; Beierle, 1990; Moffat and Gray, 1987; Giordano et al. 1992; Sannela and Wallen, 1992; Schreiweis et al. 1993; Meier and Schimpf, 1993; Kwon et al. 1993), theories (McCabe, 1992) units (Lamma et al. 1991) Several authors have applied concepts of the object oriented programming to achieve structuring of logic programs (Kowalski, 1979; Zaniolo, 1984; Gallaire, 1986; Leonardi et al. 1989; Mello, 1991; McCabe, 1992; Razek, 1992; Xu and Zheng, ....
Kwon K., Nadathur G. and Wilson D.S. (1993): Implementing a notion of modules in the logic programming language Prolog. In: (Lamma and Mello, 1993), pp.359--393.
Modularity In Logic Programming - Bugliesi, Lamma, Mello (1993) (54 citations) (Correct)
....of M is discarded and becomes inaccessible to subsequent goals. In the architecture proposed by Lamma et al. in [57, 58] closures are implemented as new data structures called instance environments. A corresponding structure, called implication point, is used by Jayaraman, Nadathur et al. in [52, 84, 56] for the same purpose. The difference between these two approaches is that in the former closures are allocated in a new stack (the instance environment stack) whereas in the latter they are held in the local stack of the WAM. To outline the basic features of the implementation of embedded ....
....a separate stack. We will refer to it as the context stack and let pc denote its top element. The new instructions allocate ctx and deallocate ctx introduced in [57, 58] will be used for manipulating the context stack (two corresponding instructions, push impl point and pop impl point are used in [84, 56]) As an example, consider the goal (M 1 oe G 1 ) G 2 . The compiled code for this goal is opened by an allocate ctx instruction for M 1 , it is followed by the code for G 1 (which is thus evaluated in a context stack containing the closure of M 1 ) then by a deallocate ctx which deallocates the ....
[Article contains additional citation context not shown here]
K. Kwon, G. Nadathur, and D.S. Wilson. Implementing a Notion of Modules in the Logic Programming Language Prolog. In E. Lamma and P. Mello, editors, Extensions of Logic Programming, LNAI 660, pages 359--393. Springer-Verlag, 1993.
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