A compositional semantic basis for the analysis of equational Horn programs

Theoretical Computer Science

Volumn 165, Issue 1, 1996, Pages 133-169

  Alpuente, María ^a   Falaschi, Moreno ^b   Vidal, Germán ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; CONSTRAINT THEORY; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SOFTWARE ENGINEERING;

ABSTRACT; COMPOSITIONAL SEMANTIC; CONSTRAINT EQUATIONAL SETTING; EQUATIONAL HORN PROGRAMS; EQUATIONAL THEORY; OPERATIONAL SEMANTICS;

COMPUTATIONAL LINGUISTICS;

EID: 0346158767     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00043-6     Document Type: Article

References (41)

1. M. Alpuente, M. Falaschi and G. Levi, Incremental constraint satisfaction for equational logic programming, Theoret. Comput. Sci. 142 (1) (1995) 27-57.
2. M. Alpuente, M. Falaschi and F. Manzo, Analyses of unsatisfiability for equational logic programming. J. Logic Programming 22 (3) (1995) 221-252.
3. M. Alpuente, M. Falaschi, M.J. Ramis and G. Vidai, Optimization of equational logic programs using abstract narrowing. Tech. Report DSIC-II/1/93, UPV, 1993. Short version in J. Penjam and M. Bruynooghe, ed., Proc. of PLILP'93, - Lecture Notes in Computer Science, Vol. 714 (Springer, Berlin, 1993) 391-409.
4. M. Alpuente, M. Falaschi, M.J. Ramis and G. Vidal, A compositional semantics for conditional term rewriting systems, in: H.E. Bal, ed., Proc. 6th IEEE Internat. Conf. on Computer Languages ICCL'94 (IEEE Computer Society Press, 1994) 171-182.
5. M. Alpuente, M. Falaschi and G. Vidal, Compositional analysis for equational horn programs, in: G. Levi and M. Rodríguez-Artalejo, eds., Proc. 5th Internat Conf. on Algebraic and Logic Programming, ALP'94, Lecture Notes in Computer Science, Vol. 850 (Springer, Berlin, 1994) 77-94.
6. J. Chabin and P. Réty, Narrowing directed by a graph of terms, in: R.V. Bosk, ed., Proc. of RTA'91, Lecture Notes in Computer Science, Vol. 488 (Springer, Berlin, 1991) 112-123.
7. M. Codish, M. Falaschi and K. Marriott, Suspension analyses for concurrent logic programs, ACM Trans. Programming Languages and Systems 16 (3) (1994) 649-686.
8. P. Cousot and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proc. 4th ACM Symp. Principles of Programming Languages (1977) 238-252.
9. F.S. de Boer and C. Palamidessi, On the asynchronous nature of communication in concurrent logic languages: a fully abstract model based on sequences, in: J.C.M. Baeten and J.W. Klop, eds., Proc. of Concur 90, Lecture Notes in Computer Science, Vol. 458 (Springer, Berlin, 1990) 175-194.
10. D. de Schreye and S. Decorte, Termination of logic programs: the never ending story, J. Logic Programming 19/20 (1994) 199-260.
11. N. Dershowitz and J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics (Elsevier, Amsterdam, 1990) 243-320.
12. N. Dershowitz and N. Lindenstrauss, An abstract concurrent machine for rewriting, in: H. Kirchner and W. Wechler, eds., Proc. 2nd Internat Conf. on Algebraic and Logic Programming, Lecture Notes in Computer Science, Vol. 463 (Springer, Berlin, 1990) 318-331.
13. M. Gabbrielli and G. Levi, On the semantics of logic programs, in: J. Leach Albert, B. Monien and M. Rodriguez Artalejo, eds., Automata, Languages and Programming, 18th Internat. Colloq., Lecture Notes in Computer Science, Vol. 510 (Springer, Berlin, 1991) 1-19.
14. J.H. Gallier and S. Raatz, Extending SLD-resolution to equational Horn clauses using E-unification, J. Logic Programming 6 (1989) 3-43.
15. E. Giovannetti and C. Moiso, A completeness result for E-unification algorithms based on conditional narrowing, in: M. Boscarol, L. Carlucci and G. Levi, eds., Foundations of Logic and functional programming, Lecture Notes in Computer Science, Vol. 306 (Springer, Berlin, 1986) 157-167.
16. M. Hanus, The integration of functions into logic programming: from theory to practice, J. Logic Programming 19&20 (1994) 583-628.
17. M. Hermenegildo and F. Rossi, Strict and non-strict independent and-parallelism in logic programs: correctness, efficiency and compile-time conditions, J. Logic Programming 22(1) (1995) 1-45.
18. M. Höhfeld and G. Smolka, Definite relations over constraint languages, Tech. Report, IBM Deutschland GmbH, Stuttgart, 1988.
19. S. Hölldobler, Foundations of Equational Logic Programming, Lecture Notes in Artificial Intelligence, Vol. 353 (Springer, Berlin, 1989).
20. J.M. Hullot, Canonical forms and unification, in: Proc. 5th Internat Conf on Automated Deduction, Lecture Notes in Computer Science, Vol. 87 (Springer, Berlin, 1980) 318-334.
21. J.-M. Jacquet, Conclog: a methodological approach to concurrent logic programming, Ph.D. Thesis, University of Namur, Belgium, 1989.
22. J. Jaffar and J.-L. Lassez, Constraint logic programming, in: Proc. 14th Ann. ACM Symp. on Principles of Programming Languages (ACM, New York, 1987) 111-119.
23. J. Jaffar, J.-L. Lassez and M.J. Maher, A theory of complete logic programs with equality, J. Logic Programming 3 (1984) 211-223.
24. J.W. Klop, Term rewriting systems, in: S. Abramsky, D. Gabbay and T. Maibaum, eds., Handbook of Logic in Computer Science, Vol. I (Oxford University Press, Oxford, 1992) 1-112.
25. H. Kuchen and W. Hans, An AND-parallel implementation of the functional logic language babel, in: Aachener Informatik-Bericht, Vol. 12 (RWTH Aachen, 1991) 119-139.
26. H. Kuchen, J.J. Moreno-Navarro and M. Hermenegildo, Independent AND-parallel implementation of narrowing, in: M. Bruynooghe and M. Wirsing, eds., Proc. PLILP'92 (Leuven Belgium), Lecture Notes in Computer Science, Vol. 631 (Springer, Berlin, 1992) 24-38.
27. J.-L. Lassez, M.J. Maher and K. Marriott, Unification revisited, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA. 1988) 587-625.
28. M.J. Maher, Complete axiomatizations of the algebras of finite, rational and infinite trees, in: Proc. Third IEEE Symp. on Logic In Computer Science (Computer Science Press, New York, 1988) 348-357.
29. M.J. Maher, On parameterized substitutions, Tech. Report RC 16042, IBM - T.J. Watson Research Center, Yorktown Heights, NY, 1990.
30. A. Middeldorp and E. Hamoen, Completeness results for basic narrowing, AAECC, 5 (1994) 213-253.
31. W. Nutt, P. Réty and G. Smolka, Basic narrowing revisited, J. Symbolic Comput. 7 (1989) 295-317.
32. C. Palamidessi, Algebraic properties of idempotent substitutions, in: M.S. Paterson, ed., Proc. of the 17th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 443 (Springer, Berlin, 1990) 386-399.
33. G. Plotkin, A structured approach to operational semantics, Tech. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
34. U.S. Reddy, Narrowing as the operational semantics of functional languages, in: Proc. 2nd IEEE Internat. Symp. on Logic Programming (IEEE, New York, 1985) 138-151.
35. P. Réty, C. Kirchner, H. Kirchner and P. Lescanne, NARROWER: A new algorithm for unification and its applications to logic programming, in: Proc. RTA'85, Lecture Notes in Computer Science, Vol. 202 (Springer, Berlin, 1985) 141-157.
36. V. Saraswat, M. Rinard and P. Panangaden, Semantic foundation of concurrent constraint programming, in: Proc. 18th Ann. ACM Symp. on Principles of Programming Languages POPL'91 (1991) 333-352.
37. D. Scott, Domains for Denotational semantics, in: Proc. ICALP'82, Lecture Notes in Computer Science, Vol. 140 (Springer, Berlin, 1982) 577-613.
38. J.H. Siekmann, Unification theory, J. Symbolic Computation 7 (1989) 207-274.
39. J.E. Stoy, Denotational semantics: the scott-strachey approach to programming language theory (MIT Press, Cambridge, MA, 1977).
40. P. Van Hentenryck and T. Le Provost, Incremental search in constraint logic programming, New Generation Computing 9 (1991) 257-275.
41. B. Wang and R.K. Shyamasundar, Methodology for proving the termination of logic programs, in: Proc. PLILP'90, Lecture Notes in Computer Science, Vol. 456 (Springer, Berlin, 1990) 204-221.