Creating specialised integrity checks through partial evaluation of meta-interpreters

Journal of Logic Programming

Volumn 36, Issue 2, 1998, Pages 149-193

  Leuschel, Michael ^a   De Schreye, Danny ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATABASE SYSTEMS; LOGIC PROGRAMMING; PROGRAM COMPILERS;

INTEGRITY CONSTRAINTS; META INTERPRETERS;

PROGRAM INTERPRETERS;

EID: 0032142718     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(97)10012-7     Document Type: Article

References (91)

1. L.O. Andersen, Partial evaluation of C and automatic compiler generation, in: U. Kastens, P. Pfahler (Eds.), Proceedings of the Fourth International Conference on Compiler Construction, Paderborn, Germany, Lecture Notes in Computer Science, vol. 641, Springer, Berlin, 1992, pp. 251-257.
2. L.O. Andersen, Binding-time analysis and the taming of c pointers, in: Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Copenhagen, Denmark, ACM Press, New York, 1993, pp. 47-58.
3. K.R. Apt, Introduction to logic programming, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Chap. 10, North-Holland, Amsterdam, 1990, pp. 495-574.
4. M. Baudinet, Proving termination of Prolog programs: A semantic approach, J. Logic Programming 14 (1/2) (1992) 1-29.
5. K. Berikerimi, J.C. Shepherdson, Partial deduction of updateable definite logic programs, J. Logic Programming 18 (1) (1994) 1-27.
6. R. Bol, Loop checking in partial deduction, J. Logic Programming 16 (1/2) (1993) 25-46.
7. A. Bossi, N. Cocco, S. Etalle, Transformation of left terminating programs: The reordering problem, in: M. Proietti (Ed.), Logic Program Synthesis and Transformation, Proceedings of LOPSTR'95, Utrecht, The Netherlands, Lecture Notes in Computer Science, vol. 1048, Springer, Berlin, 1995, pp. 33-45.
8. A.F. Bowers, Representing Gödel object programs in Gödel, Technical Report CSTR-92-31, University of Bristol, November 1992.
9. A.F. Bowers, C.A. Gurr, Towards fast and declarative meta-programming, in: K.R. Apt, F. Turini (Eds.), Meta-logics and Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 137-166.
10. M. Bruynooghe, D. De Schreye, B. Martens, A general criterion for avoiding infinite unfolding during partial deduction, New Gener. Comput. 11 (1) (1992) 47-79.
11. F. Bry, H. Decker, R. Manthey, A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases, in: J. Schmidt, S. Ceri, M. Missikoff (Eds.), Proceedings of the International Conference on Extending Database Technology, Venice, Italy, 1988, Lecture Notes in Computer Science, Springer, Berlin, 1988, pp. 488-505.
12. F. Bry, R. Manthey, Tutorial on deductive databases, in: Logic Programming Summer School, 1990.
13. F. Bry, R. Manthey, B. Martens, Integrity verification in knowledge bases, in: A. Voronkov (Ed.), Logic Programming, Proceedings of the First and Second Russian Conference on Logic Programming, Lecture Notes in Computer Science, vol. 592, Springer, Berlin, 1991, pp. 114-139.
14. M. Bugliesi, F. Russo, Partial evaluation in Prolog: Some improvements about cut, in: E.L. Lusk, R.A. Overbeek (Eds.), Logic Programming: Proceedings of the North American Conference, MIT Press, Cambridge, MA, 1989, pp. 645-660.
15. M. Celma, H. Decker, Integrity checking in deductive databases - the ultimate method? in: Proceedings of the Fifth Australasian Database Conference, January 1994.
16. M. Celma, C. Garcí, L. Mota, H. Decker, Comparing and synthesizing integrity checking methods for deductive databases, in: Proceedings of the Tenth IEEE Conference on Data Engineering, 1994.
17. C. Consel, A tour of Schism: A partial evaluation system for higher-order applicative languages, in: Proceedings of PEPM'93, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM, New York, 1993, pp. 145-154.
18. C. Consel, O. Danvy, Tutorial notes on partial evaluation, in: Proceedings of ACM Symposium on Principles of Programming Languages (POPL'93), Charleston, South Carolina, ACM, New York, 1993.
19. S. Das, M. Williams, A path finding method for constraint checking in deductive databases, Data Knowledge Eng. 4 (1989) 223-244.
20. D. De Schreye, B. Martens, A sensible least Herbrand semantics for untyped vanilla metaprogramming, in: A. Pettorossi (Ed.), Proceedings Meta'92, Lecture Notes in Computer Science, vol. 649, Springer, Berlin, 1992, pp. 192-204.
21. H. Decker, Integrity enforcement on deductive databases, in: L. Kerschberg (Ed.), Proceedings of the First International Conference on Expert Database Systems, Charleston, South Carolina, Benjamin/ Cummings, Memo Park, CA, 1986, pp. 381-395.
22. H. Decker, Personal communication, January 1997.
23. H. Decker, M. Celma, A slick procedure for integrity checking in deductive databases, in: P. Van Hentenryck (Ed.), Proceedings of ICLP'94, MIT Press, New York, 1994, pp. 456-469.
24. M. Denecker, D. De Schreye, SLDNFA: An abductive procedure for normal abductive programs, in: K. Apt (Ed.), Proceedings of the International Joint Conference and Symposium on Logic Programming, Washington, 1992.
25. K. Doets, Levationis laus, J. Logic Comput. 3 (5) (1993) 487-516.
26. A. Ershov, On Futamura projections (in Japanese), BIT (Japan) 12 (14) (1982) 4-5.
27. H. Fujita, K. Furukawa, A self-applicable partial evaluator and its use in incremental compilation, New Gener. Comput. 6 (2/3) (1988) 91-118.
28. Y. Futamura, Partial evaluation of a computation process - an approach to a compiler-compiler. Systems Comput. Controls 2 (5) (1971) 45-50.
29. J. Gallagher, A system for specialising logic programs, Technical Report TR-91-32, University of Bristol, November 1991.
30. J. Gallagher, Tutorial on specialisation of logic programs, in: Proceedings of PEPM'93, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM, New Yok, 1993, pp. 88-98.
31. J. Gallagher, M. Bruynooghe, The derivation of an algorithm for program specialisation, New Gener. Comput. 9 (3/4) (1991) 305-333.
32. R. Glück, R. Nakashige, R. Zöchling, Binding-time analysis applied to mathematical algorithms, in: J. Dolezal, J. Fidler (Eds.), Proceedings of the Seventeenth IFIP Conference on System Modelling and Optimization, Prague, Czech Republic, Chapman & Hall, London, 1995.
33. C.A. Gurr, A Self-Applicable Partial Evaluator for the Logic Programming Language Gödel, Ph.D. Thesis, Department of Computer Science, University of Bristol, January 1994.
34. C.A. Gurr, Specialising the ground representation in the logic programming language Gödel, in: Y. Deville (Ed.), Logic Program Synthesis and Transformation, Proceedings of LOPSTR'93, Workshops in Computing, Louvain-La-Neuve, Belgium, Springer, Berlin, 1994, pp. 124-140.
35. P. Hill, J. Gallagher, Meta-programming in logic programming, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, Oxford Science Publications, Oxford University Press, Oxford, 1998, pp. 421-427.
36. P. Hill, J.W. Lloyd, The Gödel Programming Language, MIT Press, Cambridge, MA, 1994.
37. N.D. Jones, C.K. Gomard, P. Sestoft, Partial Evaluation and Automatic Program Generation, Prentice-Hall, Englewood Cliffs, NJ, 1993.
38. N.D. Jones, A. Mycroft, Stepwise development of operational and denotational semantics for Prolog, in: Proceedings of the 1984 International Symposium on Logic Programming, Atlantic City, NJ, IEEE Computer Soc. Press, Silver Spring, MD, pp. 289-298.
39. J. Jørgensen, M. Leuschel, Efficiently generating efficient generating extensions in Prolog, in: O. Danvy, R. Glück, P. Thiemann (Eds.), Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, Schloß Dagstuhl, Lecture Notes in Computer Science, vol. 1110, Springer, Berlin, 1996, pp. 238-262; Extended version as Technical Report CW 221, K.U. Leuven.
40. H.-P. Ko, M.E. Nadel, Substitution and refutation revisited, in: K. Furukawa (Ed.), Logic Programming: Proceedings of the Eighth International Conference, MIT Press, Cambridge, MA, 1991, pp. 679-692.
41. J. Komorowksi, A Specification of an Abstract Prolog Machine and its Application to Partial Evaluation, Ph.D. Thesis, Linköping Studies in Science and Technology Dissertations 69, Linköping University, Sweden, 1981.
42. J. Komorowski, An introduction to partial deduction, in: A. Pettorossi (Ed.), Proceedings Meta'92, Lecture Notes in Computer Science, vol. 649. Springer, Berlin, 1992, pp. 49-69.
43. V. Küchenhoff, On the efficient computation of the difference between consecutive database states, in: C. Delobel, M. Kifer, Y. Masunaga (Eds.), Deductive and Object-Oriented Databases, Second International Conference, Munich, Germany, Springer, Berlin, 1991, pp. 478-502.
44. A. Lakhotia, L. Sterling, How to control unfolding when specializing interpreters, New Gener. Comput. 8 (1990) 61-70.
45. S.Y. Lee, T.W. Ling, Improving integrity constraint checking for stratified deductive databases, in: Proceedings of DEXA'94, 1994.
46. S.Y. Lee, T.W. Ling, Further improvement on integrity constraint checking for stratifiable deductive databases, in: Proceedings of the Twenty-Second VLDB Conference, Bombay, India, 1996.
47. M. Leuschel, Self-Applicable Partial Evaluation in Prolog, Master's Thesis, Departement Computerwetenschappen, K.U. Leuven, Belgium, 1993.
48. M. Leuschel, Partial evaluation of the "real thing", in: L. Fribourg, F. Turini (Eds.), Logic Program Synthesis and Transformation - Meta-Programming in Logic, Proceedings of LOPSTR'94 and META'94, Pisa, Italy, Lecture Notes in Computer Science, vol. 883, Springer, Berlin, 1994, pp. 122-137.
49. M. Leuschel, Prototype partial evaluation system to obtain specialised integrity checks by specialising meta-interpreters, Prototype Compulog II, D 8.3.3, Departement Computerwetenschappen, K.U. Leuven, Belgium, September 1995; obtainable at ftp://ftp.es.kuleuven.ac.be/pub/compulog/ICLeupel/.
50. M. Leuschel, The ECCE partial deduction system and the DPPD library of benchmarks; obtainable via http://www.cs.kuleuven.ac.be/∼lpai, 1996.
51. M. Leuschel, Advanced Techniques for Logic Program Specialisation, Ph.D. Thesis, K.U. Leuven, May 1997; accessible via http://www.cs.kuleuven.ac.be/∼michael.
52. M. Leuschel, D. De Schreye, Constrained partial deduction and the preservation of characteristic trees, New Gener. Comput. 16 (1998), to appear.
53. M. Leuschel, D. De Schreye, Towards creating specialised integrity checks through partial evaluation of meta-interpreters, in: Proceedings of PEPM'95, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, La Jolla, California, ACM, New York, 1995, pp. 253-263.
54. M. Leuschel, D. De Schreye, Logic program specialisation: How to be more specific, in: H. Kuchen, S. Swierstra (Eds.), Proceedings of the International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP'96), Aachen, Germany, Lecture Notes in Computer Science, vol. 1140, Springer, Berlin, 1996, pp. 137-151; extended version as Technical Report CW 232, K.U. Leuven.
55. M. Leuschel, B. Martens, Obtaining specialised update procedures through partial deduction of the ground representation, in: H. Decker, U. Geske, T. Kakas, C. Sakama, D. Seipel, T. Urpi (Eds.), Proceedings of the ICLP'95 Joint Workshop on Deductive Databases and Logic Programming and Abduction in Deductive Databases and Knowledge Based Systems, GMD-Studien Nr. 266, Kanagawa, Japan, June 1995, pp. 81-95.
56. M. Leuschel, B. Martens, Partial deduction of the ground representation and its application to integrity checking, in: J.W. Lloyd (Ed.), Proceedings of ILPS'95, the International Logic Programming Symposium, Portland, USA, MIT Press, Cambridge, MA, 1995, pp. 495-509; extended version as Technical Report CW 210, K.U. Leuven.
57. M. Leuschel, B. Martens, D. De Schreye, Controlling generalisation and polyvariance in partial deduction of normal logic programs, ACM Trans. Programming Languages Systems 20 (1) (1998) 208-258.
58. M. Leuschel, B. Martens, K. Sagonas, Preserving termination of tabled logic programs while unfolding, in: N. Fuchs (Ed.), Proceedings of the International Workshop on Logic Program Synthesis and Transformation (LOPSTR'97), Leuven, Belgium, Lecture Notes in Computer Science, Springer, Berlin, to appear.
59. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1987.
60. J.W. Lloyd, J.C. Shepherdson, Partial evaluation in logic programming, J. Logic Programming 11 (3/ 4) (1991) 217-242.
61. J.W. Lloyd, E.A. Sonenberg, R.W. Topor, Integrity checking in stratified databases, J. Logic Programming 4 (4) (1987) 331-343.
62. J.W. Lloyd, R.W. Topor, Making PROLOG more expressive, J. Logic Programming 1 (3) (1984) 225-240.
63. J.W. Lloyd, R.W. Topor, A basis for deductive database systems, J. Logic Programming 2 (1985) 93-109.
64. 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.
65. B. Martens, On the Semantics of Meta-Programming and the Control of Partial Deduction in Logic Programming, Ph.D. Thesis, K.U. Leuven, February 1994.
66. B. Martens, D. De Schreye, Two semantics for definite meta-programs, using the non-ground representation, in: K.R. Apt, F. Turini (Eds.), Meta-logics and Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 57-82.
67. B. Martens, D. De Schreye, Why untyped non-ground meta-programming is not (much of) a problem, J. Logic Programming 22 (1) (1995) 47-99.
68. B. Martens, D. De Schreye, Automatic finite unfolding using well-founded measures, J. Logic Programming 28 (2) (1996) 89-146.
69. B. Martens, D. De Schreye, T. Horváth, Sound and complete partial deduction with unfolding based on well-founded measures, Theoret. Comput. Sci. 122 (1/2) (1994) 97-117.
70. T. Mogensen, The Application of Partial Evaluation to Ray-Tracing, Master's Thesis, DIKU, University of Copenhagen, Denmark, 1986.
71. T. Mogensen, A. Bondorf, Logimix: A self-applicable partial evaluator for Prolog, in: K.-K. Lau, T. Clement (Eds.), Logic Program Synthesis and Transformation, Proceedings of LOPSTR'92, Springer, Berlin, 1992, pp. 214-227.
72. G. Neumann, A simple transformation from Prolog-written metalevel interpreters into compilers and its implementation, in: A. Voronkov (Ed.), Logic Programming, Proceedings of the First and Second Russian Conference on Logic Programming, Lecture Notes in Computer Science, vol. 592, Springer, Berlin, 1991, pp. 349-360.
73. U. Nilsson, J. Małuszyński, Logic, Programming and Prolog, Wiley, Chichester, 1990.
74. R. O'Keefe, On the treatment of cuts in Prolog source-level tools, in: Proceedings of the Symposium on Logic Programming, IEEE Press, New York, 1985, pp. 68-72.
75. S. Owen, Issues in the partial evaluation of meta-interpreters, in: H. Abramson, M. Rogers (Eds.), Meta-Programming in Logic Programming. Proceedings of the Meta88 Workshop, MIT Press, Cambridge, MA, 1989, pp. 319-339.
76. S. Prestwich, The PADDY partial deduction system, Technical Report ECRC-92-6, ECRC, Munich, Germany, 1992.
77. S. Prestwich, An unfold rule for full Prolog, in: K.-K. Lau, T. Clement (Eds.), Logic Program Synthesis and Transformation, Proceedings of LOPSTR'92, Workshops in Computing, University of Manchester, Springer, Berlin, 1992.
78. S. Prestwich, Online partial deduction of large programs, in: Proceedings of PEPM'93, the ACM Sigplan Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM, New York, 1993, pp. 111-118.
79. M. Proietti, A. Pettorossi, Semantics preserving transformation rules for Prolog, in: Proceedings of the ACM Symposium on Partial Evaluation and Semantics based Program Manipulation, PEPM'91, Sigplan Notices, vol. 26, No. 9, Yale University, New Haven, USA, 1991, pp. 274-284.
80. Prolog by BIM 4.0, October 1993.
81. F. Sadri, R. Kowalski, A theorem-proving approach to database integrity, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Chap. 9, Morgan Kaufmann, Los Altos. CA, 1988, pp. 313-362.
82. D. Sahlin, An Automatic Partial Evaluator for Full Prolog, Ph.D. Thesis, Swedish Institute of Computer Science, March 1991.
83. D. Sahlin, Mixtus: An automatic partial evaluator for full Prolog, New Gener. Comput. 12 (1) (1993) 7-51.
84. R. Seljée, A new method for integrity constraint checking in deductive databases, Data Knowledge Eng. 15 (1995) 63-102.
85. J.C. Shepherdson, Language and equality theory in logic programming, Technical Report PM-91-02, University of Bristol, 1991.
86. M. Sperber, Self-applicable online partial evaluation, in: O. Danvy, R. Glück, P. Thiemann (Eds.), Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, Schloß Dagstuhl, Lecture Notes in Computer Science, vol. 1110, Springer, Berlin, 1996, pp. 465-480.
87. L. Sterling, R.D. Beer, Metainterpreters for expert system construction, J. Logic Programming 6 (1/2) (1989) 163-178.
88. L. Sterling, E. Shapiro, The Art of Prolog, MIT Press, Cambridge, MA, 1986.
89. A. Takeuchi, K. Furukawa, Partial evaluation of Prolog programs and its application to meta programming, in: H.-J. Kugler (Ed.), Information Processing 86, 1986, pp. 415-420.
90. M. Wallace, Compiling integrity checking into update procedures, in: J. Mylopoulos, R. Reiter (Eds.), Proceedings of IJCAI, Sydney, Australia, 1991.
91. D. Weise, R. Conybeare, E. Ruf, S. Seligman, Automatic online partial evaluation, in: Proceedings of the Conference on Functional Programming Languages and Computer Architectures, Harvard University, Lecture Notes in Computer Science, vol. 523, Springer, Berlin, 1991, pp. 165-191.