Generalised logic program transformation schemas

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

Volumn 1463, Issue , 1998, Pages 49-68

  Büyükyld, Halime ^a   Flener, Pierre ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORMAL LOGIC; FUNCTIONAL PROGRAMMING; SYNTHESIS (CHEMICAL);

GENERALISATION; LOGIC PROGRAMS; OPTIMISATIONS; TRANSFORMATION SYSTEMS; TUPLING;

LOGIC PROGRAMMING;

EID: 84897808594     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (25)

1. T. Batu. Schema-Guided Transformations of Logic Algorithms. Senior Project Report, Bilkent University, Department of Computer Science, 1996.
2. R.S. Bird. The promotion and accumulation strategies in transformational programming. ACM Transactions on Programming Languages and Systems 6(4):487-504, 1984.
3. R.S. Bird and P. Wadler. Introduction to Functional Programming. Prentice Hall, 1988.
4. H. Büyükyildiz and P. Flener. Correctness Proofs of Transformation Schemas. Technical Report BU-CEIS-9713. Bilkent University, Department of Computer Science, 1997.
5. H. Büyükyildiz. Schema-based Logic Program Transformation. M.Sc. Thesis, Technical Report BU-CEIS-9714. Bilkent University, Department of Computer Science, 1997.
6. E. Chasseur and Y. Deville. Logic program schemas, semi-unification, and constraints. In: N.E. Fuchs (ed), Proc. of LOPSTR’97 (this volume).
7. A. Cortesi, B. Le Charlier, and S. Rossi. Specification-based automatic verification of Prolog programs. In: J. Gallagher (ed), Proc. of LOPSTR’96, pp. 38-57. LNCS 1207. Springer-Verlag, 1997.
8. S.K. Debray and N.W. Lin. Cost analysis of logic programs. ACM TOPLAS 15(5):826-875, 1993.
9. Y. Deville. Logic Programming: Systematic Program Development. Addison-Wesley, 1990.
10. Y. Deville and J. Burnay. Generalization and program schemata: A step towards computer-aided construction of logic programs. In: E.L. Lusk and R.A. Overbeek (eds), Proc. of NACLP’89, pp. 409-425. The MIT Press, 1989.
11. P. Flener and Y. Deville. Logic program transformation through generalization schemata. In: M. Proietti (ed), Proc. of LOPSTR’95, pp. 171-173. LNCS 1048. Springer-Verlag, 1996.
12. P. Flener, K.-K. Lau, and M. Ornaghi. On correct program schemas. In: N.E. Fuchs (ed), Proc. of LOPSTR’97 (this volume).
13. N.E. Fuchs and M.P.J. Fromherz. Schema-based transformation of logic programs. In: T. Clement and K.-K. Lau (eds), Proc. of LOPSTR’91, pp. 111-125. Springer Verlag, 1992.
14. T.S. Gegg-Harrison. Representing logic program schemata in λProlog. In: L. Sterling (ed), Proc. of ICLP’95, pp. 467-481. The MIT Press, 1995.
15. T.S. Gegg-Harrison. Extensible logic program schemata. In: J. Gallagher (ed), Proc. of LOPSTR’96, pp. 256-274. LNCS 1207. Springer-Verlag, 1997.
16. A. Hamfelt and J. Fischer Nilsson. Declarative logic programming with primitive recursion relations on lists. In: L. Sterling (ed), Proc of JICSLP’96. The MIT Press.
17. A. Pettorossi and M. Proietti. Transformation of logic programs: foundations and techniques. Journal of Logic Programming 19(20):261-320, 1994.
18. J. Richardson and N.E. Fuchs. Development of correct transformation schemata for Prolog programs. In: N.E. Fuchs (ed), Proc. of LOPSTR’97 (this volume).
19. D. Sahlin. An Automatic Partial Evaluator of Full Prolog. Ph.D. Thesis, Swedish Institute of Computer Science, 1991.
20. D.R. Smith. Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence 27(1):43-96, 1985.
21. D.R. Smith. KIDS: A semiautomatic program development system. IEEE Transactions on Software Engineering 16(9):1024-1043, 1990.
22. Z. Somogyi, F. Henderson, and T. Conway. Mercury: An efficient purely declarative logic programming language. In: Proc. of the Australian Computer Science Conference, pp. 499-512, 1995.
23. L.S. Sterling and M. Kirschenbaum. Applying techniques to skeletons. In: J.- M. Jacquet (ed), Constructing Logic Programs, pp. 127-140, John Wiley, 1993.
24. M.E. Stickel. A Prolog technology theorem prover: A new exposition and implementation in Prolog. Theoretical Computer Science 104:109-128, 1992.
25. W.W. Vasconcelos and N.E. Fuchs. An opportunistic approach for logic program analysis and optimisation using enhanced schema-based transformations. In: M. Proietti (ed), Proc. of LOPSTR’95, pp. 174-188. LNCS 1048. Springer-Verlag, 1996.