Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Directional Type Checking for Logic Programs: Beyond Discriminative Types


Charatonik,  Witold
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Charatonik, W. (2000). Directional Type Checking for Logic Programs: Beyond Discriminative Types. In G. Smolka (Ed.), Proceedings of the 8th European Symposium on Programming (ESOP-00) (pp. 72-87). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3424-4
Directional types form a type system for logic programs which is based on the view of a predicate as a {\em directional procedure\/} which, when applied to a tuple of input terms, generates a tuple of output terms. It is known that directional-type checking wrt.\ arbitrary types is undecidable; several authors proved decidability of the problem wrt.\ discriminative regular types. In this paper, using techniques based on tree automata, we show that directional-type checking for logic programs wrt.\ general regular types is \dexptime-complete and fixed-parameter linear. The letter result shows that despite the exponential lower bound, the type system might be usable in practice.