On Dart-Zobel Algorithm for Testing Regular Type Inclusion
Logic in Computer Science
2007-05-23 v1 Programming Languages
Abstract
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 incorrect for regular types. We also prove that the algorithm is complete for regular types as well as correct for tuple distributive regular types. Also presented is a simplified version of Dart-Zobel algorithm for tuple distributive regular types.
Cite
@article{arxiv.cs/9810001,
title = {On Dart-Zobel Algorithm for Testing Regular Type Inclusion},
author = {Lunjin Lu and John G. Cleary},
journal= {arXiv preprint arXiv:cs/9810001},
year = {2007}
}
Comments
16 pages