Hi All,

This is not a haskell problem. I need some pointers which some of you might provide.

In program calculation community, segement problems e.g. maximum sum problem have been studied extensively. The problems involve finding a segment of the list that maximizes some objective function and satisfies some predicate.

But I am wondering if is there similar study on the family of problems where we need to find all the segments of a list that satisfy some predicate. I am interested in predicates involving forall and existential quantifiers.

Thanks for any suggestion.

Cheers,

Saswat