Polymorphic type analysis in logic programs by abstract interpretation

Journal of Logic Programming

Volumn 36, Issue 1, 1998, Pages 1-54

  Lu, Lunjin ^a  

^a UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

POLYMORPHIC ABSTRACT INTERPRETATION; POLYMORPHIC ANALYSIS;

LOGIC PROGRAMMING;

EID: 0032123133     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(97)10010-3     Document Type: Article

References (50)

1. H. Azzoune, Type inference in Prolog, in: E. Lusk, R. Overbeek (Eds.), Proceedings of the Ninth International Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 310, Springer, Berlin, 1988, pp. 258-277.
2. R. Barbuti, R. Giacobazzi, A bottom-up polymorphic type inference in logic programming, Science of Computer Programming 19 (3) (1992) 133-181.
3. A. Bossi, M. Gabbrielli, G. Levi, M. Meo, A compositional semantics for logic programs, Theoretical Computer Science 122 (1&2) (1994) 3-47.
4. M. Bruynooghe, Adding redundancy to obtain more reliable and more readable Prolog programs, Proceedings of the First International Logic Programming Conference, Marseille, France, 1982, pp. 129-133.
5. M. Bruynooghe, A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming 10 (2) (1991) 91-124.
6. M. Bruynooghe, G. Janssens, A. Callebaut, B. Demoen, Abstract interpretation: Towards the global optimisation of Prolog programs, Proceedings of the 1987 Symposium on Logic Programming, The IEEE Computer Soc. Press, Silver Spring, MD, 1987, pp. 192-204.
7. L. Cardelli, P. Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys 17 (4) (1985) 471-522.
8. W.F. Clocksin, C. Mellish, Programming in Prolog, Springer, Berlin, 1984.
9. M. Codish, D. Dams, Yardeni E. Derivation and safety of an abstract unification algorithm for groundness and aliasing analysis, in: K. Furukawa, (Eds.), Proceedings of the Eighth International Conference on Logic Programming, The MIT Press, Cambridge, MA, 1991, pp. 79-93.
10. M. Codish, B. Demoen, Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop, Proceedings of the First Symposium on Static Analysis, of Lecture Notes in Computer Science, vol. 864, Springer, Berlin, 1994, pp. 281-297.
11. M.M. Corsini, K. Musumbu, Type inference: A new approach, Theoretical Computer Science 119 (1) (1993) 23-38.
12. A. Cortesi, B. Le Charlier, P. Van Hentenryck, Combinations of abstract domains for logic programming, Conference Record of the Twenty-first ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, New York, 1994, pp. 227-239.
13. P. Cousot, R. Cousot, Abstract interpretation: A unified framework for static analysis of programs by construction or approximation of fixpoints, Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages, ACM, New York, 1977, pp. 238-252.
14. P. Cousot, R. Cousot, Abstract interpretation and application to logic programs. Journal of Logic Programming 13 (2&3) (1992) 103-179.
15. M.A. Covington, D. Nute, A. Vellino. Prolog Programming in Depth, Scott. Foresman, 1988.
16. P.W. Dart, J. Zobel, A regular type language for logic programs, in: Frank Pfenning (Ed.), Types in Logic Programming, The MIT Press, Cambridge, MA, 1992, pp. 157-187.
17. M. Falaschi, G. Levi, C. Palamidessi, Declarative modelling of the operational behavior of logic programs, Theoretical Computer Science 69 (3) (1989) 289-318.
18. T.W. Früehwirth, Using meta-interpreters for polymorphic type checking, in: M. Bruynooghe (Ed.), Proceedings of the Second Workshop on Meta-Programming in Logic, Leuven, Belgium, 1990, pp. 339-351.
19. N. Heintze, J. Jaffar, A finite presentation theorem for approximating logic programs. Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, ACM, New York, 1990, pp. 197-209.
20. N. Heintze, J. Jaffar, Semantic types for logic programs, in: Frank Pfenning (Ed.), Types in Logic Programming, pp. 141-155, The MIT Press, Cambridge, MA, 1992.
21. M. Hermenegildo, R. Warren, S.K. Debray, Global flow analysis as a practical compilation tool, Journal of Logic Programming 13 (2&3) (1992) 349-366.
22. K. Horiuchi, T. Kanamori, Polymorphic type inference in Prolog by abstract interpretation, in: K. Furukawa, H. Tanaka, T. Fujisaki (Eds.), Proceedings of the Sixth Conference on Logic Programming pp. 195-214. Springer, Berlin, 1988.
23. D. Jacobs, A. Langen, Static analysis of logic programs for independent and parallelism, Journal of Logic Programming 13 (2&3) (1992) 291-314.
24. G. Janssens, M. Bruynooghe, Deriving descriptions of possible values of program variables by means of abstract interpretation, Journal of Logic Programming 13 (2&3) (1992) 205-258.
25. N.D. Jones, H. Søndergaard, A semantics-based framework for abstract interpretation of Prolog, in: S. Abramsky, C. Hankin (Eds.), Abstract Interpretation of Declarative Languages, Ellis Horwood. Chichester, UK, 1987, pp. 123-142.
26. T. Kanamori, Abstract interpretation based on Alexander templates, Journal of Logic Programming 15 (1&2) (1993) 31-54.
27. T. Kanamori, K. Horiuchi, Type inference in Prolog and its application. Proceedings of the Ninth international Joint Conference on Artificial Intelligence, 1985, pp. 704-707.
28. T. Kanamori, T. Kawamura, Abstract interpretation based on OLDT resolution, Journal of Logic Programming 15 (1&2) (1993) 1-30.
29. J.W. Lloyd, Foundations of Logic Programming. Springer, Berlin, 1987.
30. L. Lu, Abstract Interpretation, Bug detection and bug diagnosis in normal logic programs, Ph.D. thesis, University of Birmingham, 1994.
31. L. Lu, Type analysis of logic programs in the presence of type definitions, in: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'95), ACM, New York, 1995, pp. 241-252.
32. K. Marriott, Frameworks for abstract interpretation, Acta Informatica 30 (2) (1993) 103-129.
33. K. Marriott, H. Søndergaard, Semantics-based dataflow analysis of logic programs, in: G. Ritter (Ed.), Information Processing'89, North-Holland, Amsterdam, 1989, pp. 601-606.
34. K. Marriott, H. Søndergaard, Bottom-up dataflow analysis of normal logic programs, Journal of Logic Programming 13 (2&3) (1992) 181-204.
35. K. Marriott, H. Søndergaard, N.D. Jones, Denotational abstract interpretation of logic programs, ACM Transacations on Programming Languages and Systems 16 (3) (1994) 607-648.
36. C. Mellish. Abstract interpretation of Prolog programs, in: S. Abramsky, C. Hankin (Eds.), Abstract Interpretation of Declarative Languages, Ellis Horwood, Chichester, UK, 1987, pp. 181-198.
37. P. Mishra, Towards a theory of types in Prolog, in: Proceedings of the IEEE International Symposium on Logic Programming, The IEEE Computer Soc. Press, Silver Spring, MD, 1984, pp. 289-298.
38. K. Muthukumar, M. Hermenegildo, Compile-time derivation of variable dependency using abstract interpretation, Journal of Logic Programming 13 (2&3) (1992) 315-347.
39. A. Mycroft, R.A. O'Keefe, A polymorphic type system for Prolog, Artificial Intelligence 23 (3) (1984) 295-307.
40. U. Nilsson, Towards a framework for the abstract interpretation of logic programs, in: P. Deransart, B, Lorho, J. Maluszynski (Eds.), Proceedings of the International Workshop on Programming Language Implementation and Logic Programming, Springer, Berlin, 1988, pp. 68-82.
41. R.A. O'Keefe, Finite fixed-point problems, in: J.-L. Lassez (Ed.), Proceedings of the Fourth International Conference on Logic programming, vol. 2, The MIT Press, Cambridge, MA, 1987, pp. 729-743.
42. T. Sato, H. Tamaki, Enumeration of success patterns in logic programs, The oretical Computer Science 34 (1) (1984) 227-240.
43. H. Sondergaard, An application of abstract interpretation of logic programs: Occur check reduction, Proceedings of the European Symposium on Programming, Springer, Berlin, 1986, pp. 324-338.
44. L. Sterling, E. Shapiro, The Art of Prolog, The MIT Press, Cambridge, MA, 1986.
45. J. Tiuryn, Type inference problems: A survey, in: B. Roven (Ed.), Proceedings of the 15th International Symposium on Mathematical Foundations of Computer Science, Springer, Berlin, 1990, pp. 105-120.
46. M.H. Van Emden, R.A. Kowalski, The semantics of predicate logic as a programming language, Artificial Intelligence 23 (10) (1976) 733-742.
47. P. Van Hentenryck, A. Cortesi, B. Le Charlier, Type analysis of Prolog using type graphs, Journal of Logic Programming 22 (3) (1995) 179-209.
48. J. Xu, D.S. Warren, A type inference system for Prolog, in: R.A. Kowalski, K.A. Bowen (Eds.), Proceedings of the Fifth International Conference and Symposium on Logic Programming, The MIT Press, Cambridge, MA, 1988, pp. 604-619.
49. E. Yardeni, E. Shapiro, A type system for logic programs, Journal of Logic Programming 10 (2) (1991) 125-153.
50. J. Zobel, Derivation of polymorphic types for Prolog programs, in: J.-L. Lassez (Ed.), Proceedings of the Fourth International Conference on Logic Programming, The MIT Press, Cambridge, 1987, pp. 817-838.