On Dart-Zobel Algorithm for Testing Regular Type Inclusion

Simple item page
dc.creatorLu, Lunjin
dc.creatorCleary, John G.
dc.date1998-10-01
dc.date.accessioned2026-07-07T03:23:43Z
dc.date.available2026-07-07T03:23:43Z
dc.descriptionThis 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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/cs/9810001
dc.identifierhttp://arxiv.org/abs/cs/9810001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33053
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.subjectF.3.2
dc.titleOn Dart-Zobel Algorithm for Testing Regular Type Inclusion
dc.typetext

Files

Collections

arXiv