n Represent the relational algebra ‘without excessive circumlocution’.
n Provide operators to create/destroy named functions, whose value is a relation defined
by means of a specified relational expression.
n Support the comparison operators:
– (= and ≠) for tuples;
– (=, ≠, ‘is a subset of ’, ∈ for testing membership of a tuple in a relation) for relations.
n Be constructed according to well-established principles of good language design.