Abstract
We enrich the domain \(\mathcal{P}os\) by combining it with types. This makes static analysis more precise, since deduced properties concern both terms considered as a whole, and the details of their structure, as it is defined by types. We use this enriched domain to redefine first-order groundness analysis (Prolog terms) as it is formalized by Codish and Demoen [CD95] and higher-order groundness analysis (λ Prolog terms) as defined by the authors [MRB98].
Chapter PDF
References
Bonner, A.J.: Hypothetical datalog: Complexity and expressibility. Theoret- ical Computer Science 76, 3–51 (1990)
Brisset, P., Ridoux, O.: The compilation of λProlog and its execution with MALI. Rapport de recherche 1831, INRIA (1993)
Codish, M., Demoen, B.: Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol. 864, pp. 281–297. Springer, Heidelberg (1994)
Codish, M., Demoen, B.: Analyzing logic programs using Prop-ositional logic programs and a magic wand. J. Logic Programming 25(3), 249–274 (1995)
Cortesi, A., Filé, G., Winsborough, W.: Prop revisited: Propositional for- mula as abstract domain for groundness analysis. In: SLCS, vol. CH3025-4, pp. 322–327. IEEE, Los Alamitos (1991)
Debray, S.K., Warren, D.S.: Detection and optimization of functional computations in prolog. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol. 225, pp. 490–504. Springer, Heidelberg (1986)
Falaschi, M., Levi, G., Martelli, M., Palamidessi, C.: Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science 69(3), 289–318 (1989)
Hanus, M.: Horn clause programs with polymorphic types: Semantics and resolution. In: Díaz, J., Orejas, F. (eds.) TAPSOFT 1989 and CCIPL 1989. LNCS, vol. 352, pp. 225–240. Springer, Heidelberg (1989)
Hill, P.M., Topor, R.W.: A semantics for typed logic programs. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 1–62. MIT Press, Cambridge (1992)
Hermenegildo, M.V., Warren, R., Debray, S.K.: Global flow analysis as a practical compilation tool. J. Logic Programming 13(4), 349–366 (1992); preliminary version: ICLP 1988, pp. 684–699 (1988)
Lakshman, T.K., Reddy, U.S.: Typed Prolog: A semantic reconstruction of the Mycroft-O’Keefe type system. In: Saraswat, V., Ueda, K. (eds.) 8th Int. Logic Programming Symp., pp. 202–217. MIT Press, Cambridge (1991)
Louvet, P., Ridoux, O.: Parametric polymorphism for Typed Prolog and λProlog. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol. 1140, pp. 47–61. Springer, Heidelberg (1996)
Malésieux, F.: Contribution à l’analyse statique de programmes λProlog. PhD thesis, Université de Nantes (1999)
Milner, R.: A theory of type polymorphism in programming. J. Computer and System Sciences 17, 348–375 (1978)
Mycroft, A., O’Keefe, R.A.: A polymorphic type system for Prolog. Artificial Intelligence 23, 295–307 (1984)
Malésieux, F., Ridoux, O., Boizumault, P.: Abstract compilation of λProlog. In: Jaffar, J. (ed.) Joint Int. Conf. and Symp. Logic Programming, pp. 130–144. MIT Press, Cambridge (1998)
Marriott, K., Søndergaard, H.: Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems 2(1-4), 181–196 (1993)
Nadathur, G., Pfenning, F.: The type system of a higher-order logic programming language. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 245–283. MIT Press, Cambridge (1992)
O’Keefe, R.A.: The Craft of Prolog. MIT Press, Cambridge (1990)
Ramakrishnan, R., Ullman, J.: A survey of deductive database systems. J. Logic Programming 23(2), 125–149 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ridoux, O., Boizumault, P., Malésieux, F. (1999). Typed Static Analysis: Application to Groundness Analysis of Prolog and λ Prolog . In: Middeldorp, A., Sato, T. (eds) Functional and Logic Programming. FLOPS 1999. Lecture Notes in Computer Science, vol 1722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10705424_18
Download citation
DOI: https://doi.org/10.1007/10705424_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66677-6
Online ISBN: 978-3-540-47950-5
eBook Packages: Springer Book Archive