Mode analysis domains for typed logic programs

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

Volumn 1817, Issue , 2000, Pages 82-101

  Smaus, Jan Georg ^a   Hill, Patricia M ^b   King, Andy ^c  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITY OF LEEDS   (United Kingdom)

^c UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER CIRCUITS; LOGIC PROGRAMMING;

ABSTRACT DOMAINS; ABSTRACTION FUNCTIONS; CONSTRUCTION PROCEDURES; LOGIC PROGRAMS; MODE ANALYSIS; MODE INFORMATION; OPTIMISATIONS; PROGRAM DEVELOPMENT TOOLS;

PROGRAM COMPILERS;

EID: 84949660405     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10720327_6     Document Type: Conference Paper

References (23)

1. A. Aiken and T. K. Lakshman. Directional type checking of logic programs. In SAS '94, pages 43-60. Springer-Verlag, 1994.
2. H. Christiansen. Deriving declarations from programs. Technical report, Roskilde University, P.O.Box 260, DK-4000 Roskilde, 1997.
3. M. Codish and B. Demoen. Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop. In SAS'94, pages 281-297. Springer-Verlag, 1994.
4. M. Codish and B. Demoen. Analyzing logic programs using “PROP”-ositional logic programs and a Magic Wand. Journal of Logic Programming, 25(3):249-274, 1995.
5. M. Codish and V. Lagoon. Type dependencies for logic programs using ACI-unification. In Israeli Symposium on Theory of Computing and Systems, pages 136-145. IEEE Press, 1996.
6. P. Cousot and R. Cousot. Comparing the Galois connection and widening/ narrowing approaches to abstract interpretation. In M. Bruynooghe and M. Wirsing, editors, PLILP'92, LNCS, pages 269-295. Springer-Verlag, 1992.
7. J. Gallagher, D. Boulanger, and H. Sağlam. Practical model-based static analysis for definite logic programs. In J. W. Lloyd, editor, ILPS'95, pages 351-365. MIT Press, 1995.
8. A.J. Heaton, P.M. Hill, and A.M. King. Analysing logic programs with delay for downward-closed properties. In N.E. Fuchs, editor, LOPSTR'97, LNCS. Springer-Verlag, 1997.
9. P.M. Hill and A. King. Determinacy and determinacy analysis. Journal of Programming Languages, 5(1):135-171, 1997.
10. P.M. Hill and J.W. Lloyd. The Gödel Programming Language. MIT Press, 1994.
11. S. Kahrs. Limits of ML-definability. In H. Kuchen and S. D. Swierstra, editors, PLILP'96, LNCS, pages 17-31. Springer-Verlag, 1996.
12. A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Type recursion in the presence of polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):290-311, 1993.
13. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
14. L. Meertens. First steps towards the theory of rose trees. CWI, Amsterdam; IFIP Working Group 2.1 working paper 592 ROM-25, 1988.
15. A. Mycroft and R. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295-307, 1984.
16. F. Pfenning, editor. Types in Logic Programming, chapter 1. MIT Press, 1992.
17. J.-G. Smaus, P. M. Hill, and A. M. King. Mode analysis domains for typed logic programs. Technical Report 2000.06, School of Computer Studies, University of Leeds, 2000. c Springer-Verlag.
18. Z. Somogyi. A system of precise modes for logic programs. In ICLP'87, pages 769-787. MIT Press, 1987.
19. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, November 1996.
20. K. Stroetmann and T. Glaß. A semantics for types in Prolog: The type system of pan version 2.0. Technical report, Siemens AG, München, Germany, 1995.
21. Jichang Tan and I-Peng Lin. Recursive modes for precise analysis of logic programs. In ILPS'97, pages 277-290. MIT Press, 1997.
22. M. van Emden. AVL tree insertion: A benchmark program biased towards Prolog. Logic Programming Newsletter 2, 1981.
23. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of Prolog using type graphs. Technical Report CS-93-52, Brown University Box 1910, Providence, RI 02912, November 1993.