On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Type declarations as subtype constraints in logic programming
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
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
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
Fast and precise regular approximations of logic programs
Proceedings of the eleventh international conference on Logic programming
Type analysis of logic programs in the presence of type definitions
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Type definitions with parameters
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Type-Based XML Processing in Logic Programming
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
A practical type analysis for verification of modular prolog programs
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper answers open questions about the correctness and the completeness of Dart-Zobel algorithm for testing the inclusion relation between two regular types. We show that the algorithm is complete but incorrect for regular types.