Advertisement

Approximating constraint logic programs using polymorphic types and regular descriptions

  • Hüseyin Sağlam
  • John P. Gallagher
Posters and Demonstrations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 982)

References

  1. 1.
    R. Barbuti and R. Giacobazzi. A bottom-up polymorphic type inference in logic programming. Science of Computer Programming, 19:281–313, 1992.Google Scholar
  2. 2.
    M. Codish and B. Demoen. Deriving polymorphic type dependencies for logic programs using multiple incarnations of prop. In Proceedings of the First Symposium on Static Analysis, pages 281–297, Springer-Verlag, September 1994.Google Scholar
  3. 3.
    J. Gallagher and D.A. de Waal. Fast and precise regular approximations of logic programs. In Proceedings of the Eleventh International Conference on Logic Programming, pages 599–613, MIT Press, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Hüseyin Sağlam
    • 1
  • John P. Gallagher
    • 1
  1. 1.Department of Computer ScienceUniversity of BristolBristolUK

Personalised recommendations