Type dependencies for logic programs using ACI-unification

Theoretical Computer Science

Volumn 238, Issue 1-2, 2000, Pages 131-159

  Codish, Michael ^a   Lagoon, Vitaly ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

ACI unification; Logic programs; Type analysis

Indexed keywords

EID: 0000922612     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00122-4     Document Type: Article

References (45)

1. A. Aiken, T.K. Lakshman, Directional type checking of logic programs, in: Le Charlier (Ed.), 1st Internat. Symp. on Analysis, Namur, Belgium, Lecture Notes in Computer Science, vol. 864, Springer, Berlin, 1994, pp. 43-60.
2. K.R. Apt, Introduction to logic programming, in: J. van Leeuwen, (Ed.), Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, Elsevier, Amsterdam and MIT Press, Cambridge, MA, 1990, pp. 495-574.
3. K.R. Apt, Declarative programming in prolog, in: D. Miller, (Ed.), Logic Programming - Proc. 1993 Internat. Symp., Vancouver, Canada, 1993, MIT Press, Cambridge, MA, pp. 12-35.
4. F. Baader, J. Siekmann, Unification theory, in: C. Hogger, D. Gabbay, J. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 2, Oxford Science Publications, Oxford, 1994, pp. 41-126.
5. R. Bagnara, R. Giacobazzi, G. Levi, An application of constraint propagation to data-flow analysis, in: Proc 9th IEEE Conf. on AI Applications, Orlando FL, 1993, IEEE Computer Society Press, Silverspring, MD, pp. 270-276.
6. F. Bancilhon, D. Maier, Y. Sagiv, J.D. Ullman, Magic sets and other strange ways to implement logic programs, in: Proc. ACM Symp. on Principles of Database Systems, 1986, pp. 1-15.
7. R. Barbuti, R. Giacobazzi, A bottom-up polymorphic type inference in logic programming, Sci. Comput. Programming 19 (3) (1992) 281-313.
8. A. Bossi, M. Gabbrielli, G. Levi, M. Martelli, The s-semantics approach: Theory and applications, J. Logic Programming, to appear.
9. J. Boye, Directional Types In Logic Programming, Ph.D. thesis, Linköping University, Sweden, 1996.
10. J. Boye, J. Malłuszyński, Two aspects of directional types, in L. Sterling (Ed.), Proc. 12th Internat. Conf. on Logic Programming, Kanagawa, Japan, MIT Press, Cambridge, MA, 1995.
11. F. Bronsard, T.K. Lakshman, U.S. Reddy, A framework of directionality for proving termination of logic programs, in: Apt (Ed.), Proc. Joint Internat. Conf. and Symp. on Logic Programming, Washington, USA, November 1992, MIT Press, Cambridge, MA, pp. 321-335.
12. M. Codish, Efficient goal directed bottom-up evaluation of logic programs, Technical report, Ben-Gurion University, January 1997. ftp://ftp.cs.bgu.ac.il/pub/people/codish/fastmagic.ps.gz.
13. M. Codish, D. Dams, E. Yardeni, Bottom-up abstract interpretation of logic programs, Theoret. Comput. Sci. 124 (1) (1994) 93-125.
14. M. Codish, B. Demoen, Deriving polymorphic type dependencies for logic programs using multiple incarnation of prop, in: Le Charlier (Ed.), 1st Internet, symp. on Analysis, Namur, Belgium, Lecture Notes in Computer Science, vol. 864, Springer, Berlin, 1994, pp. 281-296.
15. M. Codish, B. Demoen, Analyzing logic programs using "PROP"-ositional logic programs and a magic wand, J. Logic Programming 25 (3) (1995) 249-274.
16. M. Codish, B. Demoen, K. Sagonas, General purpose semantic based analysis using XSB. Technical report, Ben-Gurion University of the Negev, January 1997. ftp://ftp.cs.bgu.ac.il/pub/people/codish/ absxsb.ps.
17. M. Codish, V. Lagoon, Type dependencies for logic programs using ACI-unification, in: Proc. 4th Israel Symp. on Theory of Computing and Systems, IEEE Computer Society Press, Silverspring, MD, 1996, pp. 136-145.
18. M. Codish, V. Lagoon, F. Bueno, An algebraic approach to sharing analysis of logic programs, in: P. Van Hentenryck (Ed.), Proc. 4th Int. Static Analysis Symp., Lecture Notes in Computer Science, vol. 1302, Springer, Berlin, 1997, 68-82.
19. A. Cortesi, G. Filé, Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis, in: P. Hudak, N.D. Jones (Eds.), Proc. ACM SIGPLAN Symp. on partial evaluation and semantics based program manipulation, PEPM'91, Sigplan Notices, vol. 26, Also available as Technical Report 4/91 of Dip. di Matematica Università di Padova (Italy), 1991, pp. 52-61.
20. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proc. 4th ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1977, pp. 238-252.
21. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modeling of the operational behavior of logic languages, Theoret. Comput. Sci. 69 (3) (1989) 289-318.
22. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, A model-theoretic reconstruction of the operational semantics of logic programs, Inform. Comput. 102 (1) (1993) 86-113.
23. T. Frühwirth, Type inference by program transformation and partial evaluation, in: H. Abramson, M.H. Rogers (Ed.), Meta-Programming in Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 263-282.
24. T. Frühwirth, E. Shapiro, M.Y. Varai, E. Yardeni, Logic programs as types for logic programs, in: A.R. Meyer (Ed.), Proc. 6th Annual IEEE Symp. on Logic in Computer Science, Amsterdam, The Netherlands, July 1991, IEEE Computer Society Press, Silverspring, MD, pp. 300-309.
25. J. Gallagher, D.A. de Waal, Fast and precise regular approximation of logic programs, in: P. Van Hentenryck (Ed.), Proc. 11th Internat. Conf. on Logic Programming, Santa Margherita Ligure, Italy, MIT Press, Cambridge, MA, 1994, pp. 599-613.
26. R. Giacobazzi, S.K. Debray, G. Levi, A generalized semantics for constraint logic programs, in: Proc. Int. Conf. on 5th Generation Computer Systems, ICOT, Japan, June. ACM (Association for Computing Machinery), New York, 1992, pp. 581-591.
27. C.A. Gunter, D.S. Scott. Semantic domains, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, chap. 8, North-Holland, New York, 1990, pp. 633-674.
28. M. Hermenegildo, R. Warren, S.K. Debray, Global flow analysis as a practical compilation tool, J. Logic Programming 13 (4) (1992) 349-366.
29. D. Jacobs, A. Langen, Static Analysis of Logic Programs for Independent and Parallelism, J. Logic Programming 13(1, 2, 3 and 4) (1992) 291-314.
30. D. Kapur, P. Narendran, Complexity of unification problems with associative-commutative operators, J. Automated Reas. 9(2) (1992) 261-288.
31. M. Kifer, J. Wu, A first-order theory of types and polymorphism in logic programming, In IEEE Symp. on Logic in Computer Science, 1991.
32. V. Lagoon, Logic program analysis using set logic programs. Master's thesis, Ben-Gurion University of the Negev, Israel, 1998.
33. B. Le Charlier (Ed.), 1st Internat. Symp. on Static Analysis, Namur, Belgium, Lecture Notes in Computer Science, vol. 864, Springer, Berlin, September 1994.
34. P. Lincoln, J. Christian, Adventures in associative-commutative unification, J. Symbolic Comput. 8 (1989) 217-240. Appears also in: C. Kirchner (Ed.), Unification, Academic Press, New York, 1990, pp. 393-416.
35. P. Lincoln, J. Christian, Adventures in associative-commutative unification, J. Symbolic Comput. 8 (1989) 217-240. Appears also in: C. Kirchner (Ed.), Unification, Academic Press, New York, 1990, pp. 393-416.
36. J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
37. K. Marriott, H. Søndergaard, Precise and efficient groundness analysis for logic programs, ACM Lett. on Programming Languages and Systems (LOPLAS) 2 (4) (1993) 181-196.
38. D. Pedreschi, A proof method for run-time properties of Prolog programs, in: P. Van Hentenryck (Ed.), Proc. 11th Internet. Conf. on Logic Programming, Santa Margherita Ligure, Italy, MIT Press, Cambridge, MA, 1994, pp. 584-598.
39. F. Pfenning (Ed.) Types in Logic Programming, MIT Press, Cambridge, MA, 1992.
40. C. Pyo, U.S. Reddy, Inference of polymorphic types for logic programming, in: E. Lusk, R. Overbeek (Ed.), Proc. North American Conf. on Logic Programming'89, MIT Press, Cambridge, MA, 1989, pp. 1115-1132.
41. Y. Rouzaud, L. Nguyen-Phuong, Integrating modes and subtypes into a Prolog type-checker, in: Apt (Ed.), Proc. Joint Internat. Conf. and Symp. on Logic Programming, Washington, USA, MIT Press, Cambridge, MA, 1992, pp. 85-97.
42. M.E. Stickel, A unification algorithm for associative-commutative functions, J. ACM 28 (2) (1981) 423-434.
43. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.
44. P. Van Hentenryck (Ed.), Proc. 11th Internat. Conf. on Logic Programming, Santa Margherita Ligure, Italy, MIT Press, Cambridge, MA, 1994.
45. J. Xu, D.S. Warren, A type inference system for Prolog, in: R.A. Kowalski, Kenneth A. Bowen (Ed.s), Proc. 5th Internat. Conf. and Symp. on Logic Programming, Seatle, ALP, IEEE, MIT Press, Cambridge, MA, 1988, pp. 604-619.