Directional Type Inference for Logic Programs

@inproceedings{Charatonik1998DirectionalTI,
  title={Directional Type Inference for Logic Programs},
  author={Witold Charatonik and Andreas Podelski},
  booktitle={SAS},
  year={1998}
}
We follow the set based approach to directional types proposed by Aiken and Lakshman Their type checking algorithm works via set constraint solving and is sound and complete for given discriminative types We characterize directional types in model theoretic terms We present an algorithm for inferring directional types The directional type that we derive from a logic program P is uniformly at least as precise as any discriminative directional type of P i e any directional type out of the class… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

and D

  • J. Gallaghe
  • A. de Waal. Fast and precise regular…
  • 1994
Highly Influential
4 Excerpts

and J

  • N. Heintz
  • Ja ar. Set constraints and set-based analysis. In…
  • 1994
Highly Influential
6 Excerpts

uhwirth, E

  • T. Fr
  • Shapiro, M. Vardi, and E. Yardeni. Logic programs…
  • 1991
Highly Influential
5 Excerpts

A

  • M. Bruynooghe, H. Vandecasteele
  • de Waal, and M. Denecker. Detecting unsolv able…
  • 1998

Computing the least and the greatest model of the set-based abstraction of logic programs

  • W. Charatonik, D. McAllester, A. Podelski
  • Presented at the Dagstuhl Workshop on Tree…
  • 1997
1 Excerpt

Set constraints for greatest models

  • W. Charatonik, A. Podelski
  • Technical Report MPI-I-97-2-004, Max-Planck…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…