M. Bruynooghe, D. De Schreye, and B. Krekels; Compiling Control; Journal of Logic Programming 6 (1989), pp. 135-162. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A System For Specialising Logic Programs - Gallagher (1991) (24 citations) (Correct)
....semantics, by specialising an interpreter defining the required semantics. To name a few possibilities, meta programs could be used to specify interpreters for virtual machines, abstract interpretations [23] language extensions [24] and parallel or non standard execution strategies [8] [2]. 1.2 Future Applications More speculatively, a further range of applications is suggested by regarding proof procedures for various formal logics as meta programs. Usually in such cases take first order logic as an example one does not readily regard the proof procedure as a language ....
....idea behind the abstraction in SP is that if two atoms A and B have the same characteristic tree, then they are regarded as equivalent from the point of view of partial evaluation, and represented by a single atom. Example 4 Let P be the usual program for append(x,y,z) Let G 1 be append([1,2,3], 4,5] z) and G 2 be append( A,B,C] D,E] z) The successful derivations of G 1 and G 2 have the same characteristic paths. The constants 1,2,A,B, and so on play no part in the derivations. The goals G 1 and G 2 are equivalent as regards their unfoldings. Definition 4.1 characteristic path ....
[Article contains additional citation context not shown here]
Bruynooghe, M., De Schreye, D., and Krekels, B.; Compiling Control; Journal of Logic Programming 6 (1989), pages 135-162.
Some Low-Level Source Transformations for Logic Programs - Gallagher, Bruynooghe (1990) (23 citations) Self-citation (Bruynooghe) (Correct)
....two drawbacks. reverse(nil,Ys,Ys) reverse( X Xs] Ys,Zs) reverse(Xs,Ys, X Zs] When solving a query such as reverse( a,b,c] Ys, this uses half the heap space of the first program. Example 2. The following program was produced by a transformation using the compiling control method [4], 6] fib(N,F) p(fib(N,F) fib(0,1) fib(1,1) p(fib(0,1) p(fib(N,F) fib(N,F) p(fib(N,F) fib(N1,F1) fib(N2,F2) N2 is N1 1, N3 is N2 1, N3 1, F3 is F1 F2, p(fib(N,F) fib(N2,F2) fib(N3,F3) It represents a bottom up execution of the usual clauses defining fibonacci numbers. The ....
M. Bruynooghe, D. De Schreye, and B. Krekels; Compiling Control; Journal of Logic Programming 6 (1989), pp. 135-162.
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