Abramson, H., Rogers, M.H., eds.: Meta-Programming in Logic Programming, Cambridge, Mass., THE MIT Press (1989)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....2. solve( Goalj L1] Goalj L3] L1jList of Rules] solve(L3, append( Lapp1,Lapp1)j L] L, append( XjLapp2] Lapp3, Xj Lapp4] append(Lapp2,Lapp3,Lapp4)jLL] LL] 3. solve(List of Goals, RulejList of Rules] solve(List of Goals,List of Rules) For the initial goal append([1], 2,3] L) the corresponding goal in the meta program will be : solve( append( 1] 2,3] L1) append( Lapp1,Lapp1)jL] L, append( Xj Lapp2] Lapp3, XjLapp4] append(Lapp2,Lapp3,Lapp4)jLL] LL] Pi For the encoding of an arbitrary program Pi , both the first binary clause and the ....

....L] L, append( XjLapp2] Lapp3, Xj Lapp4] append(Lapp2,Lapp3,Lapp4)jLL] LL] 3. solve(List of Goals, RulejList of Rules] solve(List of Goals,List of Rules) For the initial goal append( 1] 2,3] L) the corresponding goal in the meta program will be : solve( append([1], 2,3] L1) append( Lapp1,Lapp1)jL] L, append( Xj Lapp2] Lapp3, XjLapp4] append(Lapp2,Lapp3,Lapp4)jLL] LL] Pi For the encoding of an arbitrary program Pi , both the first binary clause and the goal have to be adapted in an appropriate way. Now, assume that Pi is a ....

[Article contains additional citation context not shown here]

Abramson H. and Rogers M.H., editors. "Meta-Programming in Logic Programming ". Logic Programming serie. MIT Press, 1989.

....science, and more recently in their intersection area named computational logic or logic programming. Their importance and usefulness in logic [55, 56] and in theorem proving [38] in computer science [30, 51, 60] and in logic programming [7, 40, 47] has been generally recognised (see also [1, 11, 13, 32, 57] for snapshots of research) The common intuitive notion of reflection in such different areas is that of an access relationship between theories or programs at the object level and theories or programs at the metalevel. The object level is intended to represent knowledge about some domain, ....

....of theorems are given in the Appendix. 2 Reflection and Reflection Principles 2. 1 Background In this section we recall the concepts we will be introducing and discussing, giving a basic historical background and perspective of the state of the art on these topics (the reader may also refer to [1, 3, 13, 32, 50, 57] for an overview. A computational system is a system that reasons and acts upon some domain. The system represents (some of the features of) its domain under the form of data, and prescribes how these data should be manipulated. The system is causally connected (to its domain) if the system and ....

H. Abramson and M. H. Rogers, editors. Meta-Programming in Logic Programming, Cambridge, Mass., 1989. MIT Press.

....is no visible gain of doing it, however. Our description of the concept of the mega interpreter will be closely related to the meaning of the prefix meta. This prefix is frequently used in constructions as a metaprogram, a meta theory, a meta variable and it means something over the object level [1]: a meta theory is a theory over another theory, a meta variable is a variable that ranges over the (object) variables and a meta interpreter is an interpreter of another interpreter. More precisely, the meta interpreter is an interpreter that interprets a code, hence a description, of another ....

....the skeleton includes changing the skeleton, i.e. changing the existing code, while programming the extension of the kernel is nothing else than adding a new code to the kernel. The only thing one has to follow is the structure of the interface between the kernel and its extension. REFERENCES [1] Abramson, H. and Rogers, M.H. eds. Meta Programming in Logic Programming, The MIT Press, Cambridge, Massachusetts, 1989 [2] Bartk, R. Meta interpretation of Logic Programs (in Czech) Diploma Thesis, Charles University, Prague, 1993 [3] Bartk, R. and tpnek, P. Meta Interpreters and Expert ....

Abramson, H. and Rogers, M.H. (eds.), Meta-Programming in Logic Programming, The MIT Press, Cambridge, Massachusetts, 1989

....of reflection was introduced by Smith [23, 24] to study programs that need to analyze, and potentially modify, their own behavior. Reflection has since received attention in different areas of computer science. In programming languages, it has been used as a tool in the study of interpreters [3, 16, 18, 33], the design of extensible programming languages [13] and polymorphism [26] In A.I. reflection has been used to study programs that must explain their own reasoning strategy [4, 15] In databases, Stemple et al. 25] applied reflection in the dynamic creation of data types in database ....

H. Abramson and M.H. Rogers, editors. Meta-Programming in Logic Programming. MIT Press, 1989.

....and the mechanism of this interpreter. Our description of the concept of the mega interpreter will be closely related to the meaning of the prefix meta. This prefix is frequently used in constructions as a meta program, a metatheory, a meta variable and it means something over the object level [1]: a meta theory is a theory over another theory, a meta variable is a variable that ranges over the (object) variables and a meta interpreter is an interpreter of another interpreter. More precisely, the metainterpreter is an interpreter that interprets a code, hence a description, of another ....

Abramson, H. and Rogers, M.H. (eds.), Meta-Programming in Logic Programming, The MIT Press, Cambridge, Massachusetts, 1989

....of this interpreter. As we have already mentioned above, our description of the concept of the megainterpreter will be based on the meaning of the preposition meta. It is a frequently used preposition (a meta program, a meta theory, a meta variable ) that means something over the object level [1]. The meta theory is a theory over another theory;######################## #####################################. It means that the meta interpreter is an interpreter that interprets a code (i.e. a description) of another interpreter (will be explained in the Section 4.1) In the following ....

Abramson, H. and Rogers, M.H. (eds.), Meta-Programming in Logic Programming, The MIT Press, Cambridge, Massachusetts, 1989

....objects are atomic with respect to Prolog unification, and thus can only be manipulated using special system predicates, although the latter are declarative. Reports of further recent research can be found in the proceedings of the International Workshop on Meta programming in Logic Programming [1, 17]. In the following section we describe additional difficulties presented by the need to handle arithmetic constraints at the meta level in CLP(R) This motivates us to depart from the current prevailing wisdom about the treatment of variables in metalogic programming. Consequently, we will mostly ....

Harvey Abramson and M. H. Rogers, editors. Meta-programming in logic programming, Meta-88, Bristol, UK, 1988. MIT Press.

....mechanism of this interpreter. Our description of the concept of the extendible meta interpreter will be closely related to the meaning of the prefix meta. This prefix is frequently used in constructions as a metaprogram, a meta theory, a meta variable and it means something over the object level [1]: a meta theory is a theory over another theory, a meta variable is a variable that ranges over the (object) variables and a meta interpreter is an interpreter of another interpreter. More precisely, the meta interpreter is an interpreter that interprets a code, hence a description, of another ....

Abramson, H. and Rogers, M.H. (eds.), Meta-Programming in Logic Programming, The MIT Press, Cambridge, Massachusetts, 1989

....and object oriented logic programming and for many other purposes. The literature on the subject is vast. Interesting meta programs can be found in various textbooks on logic programming. Several workshop proceedings contain papers addressing theoretical problems related to meta programming [AR89, Met92]. Logic programming languages based on the ideas of meta programming such as Godel [HL91] Hilog [CKW93] Reflexive Prolog [CL89] among others are beginning to gain ground in logic programming community. In this paper we will not even attempt to mention all directions of research related to ....

H. Abramson and M. Rogers, editors. Meta-Programming in Logic Programming. MIT Press, 1989.

....reflection principle contains the consequences intended by the choice of that principle, but not entailed by the basic theory alone. Thus, this use of reflection is different in essence from previous use of reflection rules in logic programming. Following [3] metaprogramming in logic programming [1, 4] has often been based on so called metainterpreters. These are meta level clauses which explicitly represent the derivability relation of the object level language, and are added to the clauses representing the problem domain. Language and metalanguage are amalgamated and interact by means of ....

H. D. Abramson, M. H. Rogers (eds). Meta-Programming in Logic Programming. The MIT Press, 1989.

....programs is easy, and rapid prototyping of new meta linguistic abstractions is a normal style of development. It is worth exploring definitions of meta programming. The commonly accepted definition of meta programming, given for example in (Sterling and Shapiro, 1994) and in the foreword to (Abramson and Rogers, 1989) is the writing of programs that treat other programs as data. This definition is an accurate description, however, it does not convey the essence of program development using meta programming. We believe that meta programming is best viewed as a (relatively) new paradigm for programming complex ....

Abramson H. and Rogers, M. (eds.), Meta-Programming in Logic Programming, MIT Press, 1989.

....and object oriented logic programming and for many other purposes. The literature on the subject is vast. Interesting meta programs can be found in various textbooks on logic programming. Several workshop proceedings contain papers addressing theoretical problems related to meta programming [AR89, Met92]. Logic programming languages based on the ideas of meta programming such as Godel [HL91] Hilog [CKW93] Reflexive Prolog [CL89] among others are beginning to gain ground in logic programming community. In this paper we will not even attempt to mention all directions of research related to ....

H. Abramson and M. Rogers, editors. Meta-Programming in Logic Programming. MIT Press, 1989.

....introspection and proper representations of programs should be valuable for developing correct and efficient tools for software engineering. Further Reading In addition to the literature references in the preceding text, the following bibliography includes four collections of articles [1, 12, 60, 72] and two books [32, 49] that can be consulted by the interested reader to explore this topic further. Acknowledgements I would like to thank professors N. D. Jones, J. W. Lloyd, and J. F. Nilsson for valuable comments on this essay, and my colleagues and students for stimulating discussions and ....

Abramson, H. and Rogers, M. H. (eds.), Meta-Programming in Logic Programming, MIT Press, Cambridge, Mass., 1989.

....described in this paper we have implemented two software prototypes in Prolog based on concepts of meta interpretation and meta variables respectively. Because the implementation of CLP(H) requires changes of the inference machine of Prolog, we use a standard technique called meta interpretation [1,22,23,24] first. We utilize the concept of extendible meta interpreter which we proposed in our previous papers [2,3,4,5] Extendible meta interpreter is a meta interpreter whose functionality can be extended via plug in modules. The skeleton of such extendible meta interpreter, we call it kernel, is as ....

Abramson, H. and Rogers, M.H. (eds.), Meta-Programming in Logic Programming, The MIT Press, Cambridge, Massachusetts, 1989

.... Metaprogramming quickly became so common in Prolog that any self respecting textbook includes the so called vanilla meta interpreter for Prolog written in three clauses (see, for example, SS86] A series of conferences devoted exclusively to metaprogramming in logic has also been organized [AR89, Bru90, Pet92, MET94] Finally, the new language Godel [HL94] has been designed with the aim of making metaprogramming more declarative, by implementing primitively the manipulation of terms in a ground representation. The development of reflective concepts independently in three different ....

H. Abramson and M.H. Rogers, eds. Metaprogramming in Logic Programming. MIT Press, 1989.

....programs is extended with reflective capabilities. The treatment in [40] does not provide a universal theory and seems limited in its reflective power. 3.1. 3 Horn Logic Languages There is a long tradition of metacircular interpreters and meta programming in Prolog (see the papers collected in [1, 8, 43, 12, 3] and references there) strongly suggesting that a more declarative variant of Prolog can be made reflective in our axiomatic sense. The vanilla interpreters presented in the literature, for example in [55] fall short of being a universal theory and lack adequate semantics. A systematic effort ....

H. Abramson and M.H. Rogers, editors. Metaprogramming in Logic Programming. MIT Press, 1989.

....and examine models of itself and of other objects. BeBOP addresses this requirement by utilising one of the key ideas of meta level LP the notion that logic programs (sometimes called theories) can be treated as first order entities and be manipulated by other programs [Bowen and Kowalski 1982; Abramson and Rogers 1989; Burt et al. 1990] This is supported in BeBOP by the definition of Prolog theories, called dbs. A db can be manipulated as a term, and parts can be passed to other objects as messages, so enabling behaviour to be shared or duplicated. A db can also be treated as as a Prolog program, and goals ....

Abramson, H., and Rogers, M.H. 1989. Meta-Programming in Logic Programming, MIT Press, Cambridge, MA.

No context found.

Abramson, H., Rogers, M.H., eds.: Meta-Programming in Logic Programming, Cambridge, Mass., THE MIT Press (1989)

No context found.

H. Abramson and M. H. Rogers. Meta-programming in Logic Programming. The MIT Press, 1989.

No context found.

Abramson, H., and Rogers, M.H., eds., Meta-programming in Logic Programming. MIT Press, 1989.

No context found.

H. Abramson and M.H. Rogers (eds.), Meta-Programming in Logic Programming, MIT Press, 1989.

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