B. Martens and D. De Schreye. A perfect Herbrand semantics for untyped vanilla meta-programming. In K.R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 511--525, Washington, November 1992. MIT Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the formulas. This approach has been developed by Hill and Lloyd in [8] 7 . An alternative solution is to assume an untyped interpretation but restrict the object program so that the semantics of this representation is preserved. This approach has been explored by De Schreye and Martens in [11] using the concept of language independence. Informally, a program is language independent when the Herbrand model is not affected by the addition of new constant and function symbols. It can be seen that the problem is avoided in the examples here by assuming that, as in Godel, the programming ....

B. Martens and D. De Schreye. A perfect Herbrand semantics for untyped vanilla meta-programming. In K. Apt, editor, Proceedings of the Joint International Conference on Logic Programming, Washington, USA, pages 511--525, 1992.

.... for every rule A in Pi. The resulting program I Pi is called (untyped) vanilla interpreter for Pi. Notice, that terms of the language of I Pi are build from atoms of the language of Pi, constant empty, and two function symbols not and . In analysis of this program we will follow [MDS92a, MDS92b]. Since we use a stable model semantics we should first prove that I Pi has a stable model. Notice that I Pi is neither stratified nor locally stratified. It is possible to show however [MDS92a] that for any stratified program Pi, I Pi is weakly stratified and hence categorical, i.e. has a ....

....empty, and two function symbols not and . In analysis of this program we will follow [MDS92a, MDS92b] Since we use a stable model semantics we should first prove that I Pi has a stable model. Notice that I Pi is neither stratified nor locally stratified. It is possible to show however [MDS92a] that for any stratified program Pi, I Pi is weakly stratified and hence categorical, i.e. has a unique stable model [PP90b] This implies that at least for stratified programs we should not worry about existence of reasonable semantics for their vanilla meta interpreters. So let us assume that ....

[Article contains additional citation context not shown here]

B. Martens and D. De Schreye. A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. In Proc. of the Joint International Conference and Symposium on Logic Programming. The MIT Press, 1992.

....clause(A; empty) for every rule A in 5. The resulting program I 5 is called (untyped) vanilla interpreter for 5. Notice, that terms of the language of I 5 are build from atoms of the language of 5, constant empty, and two function symbols not and . In analysis of this program we will follow [MDS92a, MDS92b]. Since we use a stable model semantics we should first prove that I 5 has a stable model. Notice that I 5 is neither stratified nor locally stratified. It is possible to show however [MDS92a] that for any stratified program 5, I 5 is weakly stratified and hence categorical, i.e. has a unique ....

....5, constant empty, and two function symbols not and . In analysis of this program we will follow [MDS92a, MDS92b] Since we use a stable model semantics we should first prove that I 5 has a stable model. Notice that I 5 is neither stratified nor locally stratified. It is possible to show however [MDS92a] that for any stratified program 5, I 5 is weakly stratified and hence categorical, i.e. has a unique stable model [PP90b] This implies that at least for stratified programs we should not worry about existence of reasonable semantics for their vanilla meta interpreters. So let us assume that 5 is ....

[Article contains additional citation context not shown here]

B. Martens and D. De Schreye. A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. In Proc. of the Joint International Conference and Symposium on Logic Programming. The MIT Press, 1992.

....by means of partial deduction does indeed make metaprogramming feasible, since the specialized program and the corresponding object level program have equivalent successful derivations. We are currently investigating the extensions of our results to the case of normal programs (considered in [26] still in the case of language independent programs) and to the case of approximations of real Prolog, featuring some non logical primitives. The idea is to base the construction on recently proposed extensions of the S semantics which allow us to handle constructive negation [35,16,7] some ....

B. Martens and D. De Schreye. A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. In K. Apt, editor, Proc. Joint Int'l Conf. and Symposium on Logic Programming, pages 511--525. The MIT Press, Cambridge, Mass., 1992.

....is taken as the language of the program. 1 As an example, consider the program P 3 , p(X) r(X) not q(X) r(a) The consequences of P 3 remain p(a) and r(a) regardless of the language of the program. We will define a notion of language independence, generalizing the definition in [ Martens and De Schreye, 1992 ] such that P 3 is language independent but P 1 (and of course, P 2 ) are not. Our main purpose in this paper is to identify syntactically defined classes of programs that are language independent and language tolerant. One reason for desiring such results is suggested in the following ....

....has no effect on whether or not an atom in the original many sorted language is a consequence of the program. For P 7 , this justifies the use of query evaluation procedures that take no account of sorts. 8 Discussion A notion of language independence is defined for stratified normal programs in [ Martens and De Schreye, 1992 ] as follows: A stratified program P with underlying language L P is called language independent iff for any extension L 0 for L P , its perfect L 0 Herbrand model is equal to its perfect L P Herbrand model. Here L P is the minimal (unsorted) permissible language for P . Furthermore, ....

[Article contains additional citation context not shown here]

Bern Martens and Danny De Schreye. A perfect herbrand semantics for untyped vanilla meta-programming. Technical Report CW149, Department Computerwetenschappen, K.U. Leuven, Belgium, 1992.

....that the complexity of the construction above is in no way an indication that the proposed transformation is on itself unnecessarily complex or lacks elegance. The increased technicality is only due to the fact that D can be considered as an untyped meta program. It is well known (see e.g. 19] [24]) that such programs give rise to technical problems with respect to Herbrand semantics. Alternatives would have been to define D as a typed logic program (as in [11] or to make its clauses range restricted, using additional range predicates. Both solutions would have reduced the complexity of ....

B. Martens and D. De Schreye. A perfect Herbrand semantics for untyped vanilla meta-programming. In K.R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 511--525, Washington, November 1992. MIT Press.

....the complexity of the construction above is in no way an indication that the proposed transformation is on itself unnecessarily complex or lacks elegance. The increased technicality is only due to the fact that D can be considered as an untyped meta program. It is well known (see e.g. 19] [24]) that such programs give rise to technical problems with respect to Herbrand semantics. Alternatives would have been to define D as a typed logic program (as in [11] or to make its clauses range restricted, using additional range predicates. Both solutions would have reduced the complexity of ....

B. Martens and D. De Schreye. A perfect Herbrand semantics for untyped vanilla metaprogramming. In K.R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 511--525, Washington, November 1992. MIT Press.

No context found.

Martens, B. & De Schreye, D. (1992a), A perfect Herbrand semantics for untyped vanilla meta-programming, in K. Apt, ed., `Proceedings of the Joint International Conference on Logic Programming, Washington, USA', pp. 511--525.

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