An Emptiness Algorithm for Regular Types with Set Operators

Simple item page
dc.creatorLu, Lunjin
dc.creatorCleary, John G.
dc.date1998-11-11
dc.date.accessioned2026-07-07T03:23:48Z
dc.date.available2026-07-07T03:23:48Z
dc.descriptionAn algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterised type definitions is presented. The algorithm can also be used to decide the equivalence of two regular type expressions and the inclusion of one regular type expression in another. The algorithm strictly generalises previous work in that tuple distributivity is not assumed and set operators are permitted in type expressions.
dc.description22 pages
dc.identifierhttps://arxiv.org/abs/cs/9811015
dc.identifierhttp://arxiv.org/abs/cs/9811015
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33086
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.subjectD.3.2; F.3.2
dc.titleAn Emptiness Algorithm for Regular Types with Set Operators
dc.typetext

Files

Collections

arXiv