Typed static analysis: Application to groundness analysis of prolog and λPROLOG

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

Volumn 1722, Issue , 1999, Pages 267-283

  Ridoux, Olivier ^a   Boizumault, Patrice ^b   Malésieux, Frédéric ^b  

^a CAMPUS DE BEAULIEU   (France)

^b ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING;

FIRST ORDER; GROUNDNESS; HIGHER-ORDER;

STATIC ANALYSIS;

EID: 84957632487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10705424_18     Document Type: Conference Paper

References (20)

1. A.J. Bonner. Hypothetical datalog: Complexity and expressibility. Theoretical Computer Science, 76:3-51, 1990. 281
2. P. Brisset and O. Ridoux. The compilation of λProlog and its execution with MALI. Rapport de recherche 1831, INRIA, 1993. 271, 276
3. M. Codish and B. Demoen. Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop. In First Symp. Static Analysis, volume 864 of LNCS, pages 281-297. Springer-Verlag, 1994. 281
4. M. Codish and B. Demoen. Analyzing logic programs using "Prop"-ositional logic programs and a magic wand. J. Logic Programming, 25 (3):249-274, 1995. 267, 269
5. A. Cortesi, G. Filé, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In SLCS, volume CH3025-4, pages 322-327. IEEE, 1991. 267, 269
6. S. K. Debray and D. S. Warren. Detection and optimization of functional computations in prolog. In E.Y. Shapiro, editor, Third Int. Conf. Logic Programming, volume 225 of LNCS, pages 490-504. Springer, 1986. 269
7. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science, 69(3):289-318, 1989. 269, 280
8. M. Hanus. Horn clause programs with polymorphic types: Semantics and resolution. In TAPSOFT’89, LNCS 352, pages 225-240. Springer-Verlag, 1989. 267
9. P.M. Hill and R.W. Topor. A semantics for typed logic programs. In F. Pfenning, editor, Types in Logic Programming, pages 1-62. MIT Press, 1992. 280
10. M. V. Hermenegildo, R. Warren, and S. K. Debray. Global flow analysis as a practical compilation tool. J. Logic Programming, 13(4):349-366, 1992. preliminary version: ICLP 1988: 684-699. 268
11. T.K. Lakshman and U.S. Reddy. Typed Prolog: A semantic reconstruction of the Mycroft-O’Keefe type system. In V. Saraswat and K. Ueda, editors, 8th Int. Logic Programming Symp, pages 202-217. MIT Press, 1991. 267, 271, 280
12. P. Louvet and O. Ridoux. Parametric polymorphism for Typed Prolog and λProlog. In 8th Int. Symp. Programming Languages Implementation and Logic Programming, LNCS 1140, pages 47-61. Springer-Verlag, 1996. 267
13. F. Malésieux. Contribution a l’analyse statique de programmes λProlog. PhD thesis, Universite de Nantes, 1999. 267, 280
14. R. Milner. A theory of type polymorphism in programming. J. Computer and System Sciences, 17:348-375, 1978. 267
15. A. Mycroft and R.A. O’Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295-307, 1984. 267, 271
16. F. Malésieux, O. Ridoux, and P. Boizumault. Abstract compilation of λProlog. In J. Jaffar, editor, Joint Int. Conf. and Symp. Logic Programming, pages 130-144. MIT Press, 1998. 267, 276, 281, 281
17. K. Marriott and H. S0ndergaard. Precise and efficient groundness analysis for logic programs. A CM Letters on Programming Languages and Systems, 2(1 4):181-196, 1993. 267, 269
18. G. Nadathur and F. Pfenning. The type system of a higher-order logic programming language. In F. Pfenning, editor, Types in Logic Programming, pages 245-283. MIT Press, 1992. 267, 271
19. R.A. O’Keefe. The Craft of Prolog. MIT Press, 1990. 268, 281
20. R. Ramakrishnan and J. Ullman. A survey of deductive database systems. J. Logic Programming, 23 (2):125-149, 1995. 269