A theory of logic program specialization and generalization for dealing with input data properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1110, Issue , 1996, Pages 386-408

  Pettorossi, Alberto ^a   Proietti, Maurizio ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; INPUT OUTPUT PROGRAMS; RECONFIGURABLE HARDWARE;

FINITE SET; GENERAL METHOD; INPUT DATAS; LOGIC PROGRAMS; PARTIAL EVALUATION; PROGRAM SPECIALIZATION; SUPERLINEAR SPEEDUPS;

LOGIC PROGRAMMING;

EID: 84957718627     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61580-6_19     Document Type: Conference Paper

References (15)

1. A. Bossi, N. Cocco, and S. Dulli. A method for specializing logic programs. ACM Transactions on Programming Languages and Systems, 12(2):253-302, April 1990.
2. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, January 1977.
3. C. Consel and S.C. Khoo. Parameterized partial evaluation. ACM Transactions on Programming Languages and Systems, 15(3):463-493, 1993.
4. D. A. de Waal and J. P. Gallagher. Specialization of a unification algorithm. In T. Clement and K.-K. Lau, editors, Logic Program Synthesis and Transformation, Proceedings LOPSTR '91, Manchester, U.K., Workshops in Computing, pages 205-221. Springer-Verlag, 1992.
5. Y. Futamura and K. Nogi. Generalized partial computation. In D. Bjorner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 133-151. North-Holland, 1988.
6. J. P. Gallagher and D.A. de Waal. Deletion of redundant unary type predicates from logic programs. In Proceedings of LoPSTr'92, Manchester, U.K., pages 151-167. Springer-Verlag, 1993.
7. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
8. M. Leuschel and B. Martens. Partial deduction of the ground representation and its application to integrity checking. In J. W. Lloyd, editor, Proceedings of the 1995 International Logic Programming Symposium (ILPS'95), pages 495-509. MIT Press, 1995.
9. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second Edition.
10. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11:217-242, 1991.
11. U. W. Neumerkel. Specialization of Prolog Programs with Partially Static Goals and Binarization. PhD thesis, Technical University Wien, Austria, 1992.
12. R. Paige and S. Koenig. Finite differencing of computable expressions. ACM Transactions on Programming Languages and Systems, 4(3):402-454, 1982.
13. A. Pettorossi and M. Proietti. 'Ransformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19,20:261-320, 1994.
14. W. L. Scherlis. Program improvement by internal specialization. In Proc. 8th ACM Symposium on Principles of Programming Languages, Williamsburgh, Va, pages 41-49. ACM Press, 1981.
15. H. Tamaki and T. Sato. A generalized correctness proof of the unfold/fold logic program transformation. Technical Report 864, Ibaraki University, Japan, 1986.