| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423607 | Electronic Notes in Theoretical Computer Science | 2008 | 16 Pages |
Abstract
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 work in that tuple distributivity is not assumed and set operators are permitted in type expressions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
