Skip to main content
SpringerLink
Log in

Typed Static Analysis: Application to Groundness Analysis of Prolog and λ Prolog

  • Conference paper
Functional and Logic Programming (FLOPS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1722))

Included in the following conference series:

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].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonner, A.J.: Hypothetical datalog: Complexity and expressibility. Theoret- ical Computer Science 76, 3–51 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brisset, P., Ridoux, O.: The compilation of λProlog and its execution with MALI. Rapport de recherche 1831, INRIA (1993)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Codish, M., Demoen, B.: Analyzing logic programs using Prop-ositional logic programs and a magic wand. J. Logic Programming 25(3), 249–274 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. 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)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. 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)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Article  Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Google Scholar 

  13. Malésieux, F.: Contribution à l’analyse statique de programmes λProlog. PhD thesis, Université de Nantes (1999)

    Google Scholar 

  14. Milner, R.: A theory of type polymorphism in programming. J. Computer and System Sciences 17, 348–375 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  15. Mycroft, A., O’Keefe, R.A.: A polymorphic type system for Prolog. Artificial Intelligence 23, 295–307 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  16. 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)

    Google Scholar 

  17. 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)

    Article  Google Scholar 

  18. 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)

    Google Scholar 

  19. O’Keefe, R.A.: The Craft of Prolog. MIT Press, Cambridge (1990)

    Google Scholar 

  20. Ramakrishnan, R., Ullman, J.: A survey of deductive database systems. J. Logic Programming 23(2), 125–149 (1995)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, Campus universitaire de Beaulieu, F-35042, RENNES cedex, France

    Olivier Ridoux

  2. École des Mines de Nantes, 4, rue Alfred Kastler, BP 20722, F-44307, NANTES cedex03, France

    Patrice Boizumault & Frédéric Malésieux

Authors
  1. Olivier Ridoux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrice Boizumault
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frédéric Malésieux
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Innsbruck, Austria

    Aart Middeldorp

  2. Tokyo Institute of Technology, Graduate School of Information Sciences and Engineering Ookayama, 2-12-2, Meguro-ku, 152-8552, Tokyo, Japan

    Taisuke Sato

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation