A polymorphic type system for PROLOG.
Artificial Intelligence
Type inference problems: a survey
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
A type system for logic program
Journal of Logic Programming
Types for logic programs (abstract)
Proceedings of the 1990 North American conference on Logic programming
Efficient run-time type checking of typed logic programs
Journal of Logic Programming
Type inclusion constraints and type inference
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Fast and precise regular approximations of logic programs
Proceedings of the eleventh international conference on Logic programming
Handbook of formal languages, vol. 3
Coinductive axiomatization of recursive type equality and subtyping
Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Co-definite set constraints with membership expressions
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Type dependencies for logic programs using ACI-unification
Theoretical Computer Science
Type definitions with parameters
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On Dart-Zobel Algorithm for testing regular type inclusion
ACM SIGPLAN Notices
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Set Constraints and Set-Based Analysis
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Directional Type Checking of Logic Programs
SAS '94 Proceedings of the First International Static Analysis Symposium on Static Analysis
The Complexity of Set Constraints
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Improving precision of type analysis using non-discriminative union
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous work in that tuple distributivity is not assumed and set operators are permitted in type expressions.