Checking Emptiness of Non-Deterministic Regular Types with Set Operators

AbstractAn 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