An Emptiness Algorithm for Regular Types with Set Operators

Details An Emptiness Algorithm for Regular Types with Set Operators An Emptiness Algorithm for Regular Types with Set Operators

1998-11-11

arxiv.org/abs/cs/9811015v1

Computer Science

Logic in Computer Science

22 pages

Scientific paper

An 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.

Affiliated with

Also associated with

No associations

Rating

An Emptiness Algorithm for Regular Types with Set Operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Emptiness Algorithm for Regular Types with Set Operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Emptiness Algorithm for Regular Types with Set Operators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38086