Directional Type Checking for Logic Programs: Beyond Discriminative Types

Charatonik, Witold

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Directional Type Checking for Logic Programs: Beyond Discriminative Types

MPS-Authors

/persons/resource/persons44232

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

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

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.

引用: 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.