|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
K. Benkerimi and J. C. Shepherdson. Partial deduction of updateable definite logic programs. The Journal of Logic Programming, 18(1):1-27, January 1994.
|
| |
3
|
|
| |
4
|
|
| |
5
|
F. Bry and R. Manthey. Tutorial on deductive databases. In Logic Programming Summer School, 1990.
|
| |
6
|
|
 |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
H. Decker. Integrity enforcement on deductive databases. In L. Kerschberg, editor, Proceedings of the 1st International Conference on Expert Database Systems, pages 381-395, Charleston, South Carolina, 1986. The Benjamin/Cummings Publishing Company, Inc.
|
| |
11
|
A. P. Ershov. On Futamura projections. BIT (Japan}, 12(14):4-5, 1982. In Japanese.
|
| |
12
|
Y. Futamura. Partial evaluation of a computation process -- an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45-50, 1971.
|
| |
13
|
J. Gallagher. A system for specialising logic programs. Technical Report TR-91-32, University of Bristol, November 1991.
|
 |
14
|
|
| |
15
|
J. Gallagher and M. Bruynooghe. The derivation of an algorithm for program specialisation. New Generation Computing, 9(3 & 4):305-333, 1991.
|
| |
16
|
C. A. Gurr. A Self-Applicable Partial Evaluator for the Logic Programming Language GJdel. PhD thesis, Department of Computer Science, University of Bristol, January 1994.
|
| |
17
|
C. A. Gurr. Specialising the ground representation in the logic programming language GSdel. In Y. Deville, editor, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'93, Workshops in Computing, pages 124-140, Louvain-La-Neuve, Belgium, 1994. Springer-Verlag.
|
| |
18
|
|
| |
19
|
|
| |
20
|
|
| |
21
|
J. Komorowksi. A Specification of an Abstract Prolog Machine and its Application to Partial Evaluation. PhD thesis, LinkSping University, Sweden, 1981. LinkSping Studies in Science and Technology Dissertations 69.
|
| |
22
|
M. Leuschel. Self-applicable partial evaluation in Prolog. Master's thesis, K.U. Leuven, 1993.
|
| |
23
|
|
| |
24
|
|
| |
25
|
|
| |
26
|
|
| |
27
|
J. W. Lloyd and R. W. Topor. A basis for deductive database systems. The Journal of Logic Programming, 2:93-109, 1985.
|
| |
28
|
B. Martens. Finite unfolding revisited (part II): Focusing on subterms. Technical Report Compulog II, D 8.2.2.b, Departement Computerwetenschappen, K.U. Leuven, Belgium, 1994.
|
| |
29
|
|
| |
30
|
B. Martens and D. De Schreye. Why untyped nonground meta-programming is not (much of) a problem. Journal of Logic Programming, 22(1):47-99, 1995.
|
| |
31
|
T. Mogensen and A. Bondorf. Logimix: A selfapplicable partial evaluator for Prolog. In K.-K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation. Proceedings of LOPSTR'92, pages 214-227. Springer-Verlag, 1992.
|
| |
32
|
S. Prestwich. The PADDY partial deduction system. Technical Report ECRC-92-6, ECB.C, Munich, Germany, 1992.
|
| |
33
|
S. Prestwich. An unfold rule for full Prolog. In K.- K. Lau and T. Clement, editors, Logic Program Synthesis and Transformation. Proceeding~ of LOPSTR '9~, Workshops in Computing, "University of Manchester, 1992. Springer-Verlag.
|
 |
34
|
|
| |
35
|
Prolog by BIM 4.0, October 1993.
|
| |
36
|
|
| |
37
|
|
| |
38
|
M. Wallace. Compiling integrity checking into update procedures. In J. Mylopoulos and R. Reiter, editors, Proceeding8 of IJCAI, Sydney, Australia, 1991.
|
|