Sciweavers

ENTCS
2008
87views more  ENTCS 2008»
14 years 11 days ago
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
An 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...
Lunjin Lu