A polymorphic type system for PROLOG.
Artificial Intelligence
A finite presentation theorem for approximating logic programs
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for logic program
Journal of Logic Programming
Handbook of theoretical computer science (vol. B)
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Types in logic programming
Set based program analysis
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
Declarative programming in Prolog
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Fast and precise regular approximations of logic programs
Proceedings of the eleventh international conference on Logic programming
Haskell overloading is DEXPTIME-complete
Information Processing Letters
Program verification and Prolog
Specification and validation methods
Paths vs. trees in set-based program analysis
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the Unification Free Prolog Programs
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Set-Based Analysis of Reactive Infinite-State Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Directional Type Checking of Logic Programs
SAS '94 Proceedings of the First International Static Analysis Symposium on Static Analysis
Set-Based Analysis for Logic Programming and Tree Automata
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Encompassment Properties and Automata with Constraints
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Parameterized Complexity
| Hi-index | 0.00 |
Directional types form a type system for logic programs which is based on the view of a predicate as a 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 latter result shows that despite the exponential lower bound, the type system might be usable in practice.