A framework for analysis of typed logic programs

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

Volumn 2024, Issue , 2001, Pages 296-310

  Lagoon, Vitaly ^a   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING; RECONFIGURABLE HARDWARE;

ABSTRACT DOMAINS; GROUNDNESS; LOGIC PROGRAMS; REGULAR TREE GRAMMARS; SET CONSTRAINTS; SET LOGIC;

LOGIC PROGRAMMING;

EID: 84958963235     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44716-4_19     Document Type: Conference Paper

References (20)

1. M. Bruynooghe, G. Janssens, and A. Kágedal. Live-structure analysis for logic programming languages with declarations. In Procs. 14th ICLP, 33-47. MIT Press, 1997.
2. M. Codish and V. Lagoon. Type dependencies for logic programs using ACI unification. Theoretical Computer Science, 238(1-2):131-159, 2000.
3. M. Codish, V. Lagoon, and F. Bueno. An algebraic approach to sharing analysis of logic programs. JLP, 42(2):111-149, 2000.
4. P. Cousot and R. Cousot: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symp. on Principles of Programming Languages, 238-252, 1977.
5. B. Demoen, M. Garcia de la Banda, W. Harvey, K. Marriott, and P. Stuckey. An overview of HAL. In Procs. CP 99. LNCS 1713, 174-188, 1999.
6. J. Gallagher and D. Waal. Fast and precise regular approximations of logic programs. In Procs. 11th ICLP, 599-613. MIT Press, 1994.
7. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
8. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of Prolog using type graphs. JLP, 22(3):179-209, 1995.
9. M. V. Hermenegildo and K. J. Greene. &-Prolog and its performance: Exploiting independent And-Parallelism. In Procs. 7th ICLP, 253-268. MIT Press, 1990.
10. P. Hill and J. Lloyd. The Gödel Language. MIT Press, 1994.
11. D. Jacobs and A. Langen. Static analysis of logic programs for independent ANDparallelism. JLP, 13(2 & 3):291-314, 1992.
12. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. JLP, 13(2 & 3):205-258, 1992.
13. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1988.
14. K. Marriott and H. Søndergaard. Precise and efficient groundness analysis for logic programs. ACM TOPLAS, 2(4):181-196, 1993.
15. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, 1978.
16. A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure dataflow analysis for Prolog. ACM TOPLAS, 16(2):205-258, 1994.
17. A. Mycroft and R.A. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295-307, 1984.
18. L. Naish. Mode checking using constrained regular trees. Technical Report 98/3, Department of Computer Science, University of Melbourne, Australia, 1998.
19. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. JLP, 29(1-3):17-64, 1996.
20. H. Søndergaard. An application of abstract interpretation of logic programs: Occur check reduction. In Procs. ESOP86, LNCS 213, 327-338, 1986.