the expression graph contains no redexes, is finite and is acyclic. data constructors are not reducible, so although they look like functions there is no reduction rule
the expression graph contains no redexes, is finite and is acyclic. data constructors are not reducible, so although they look like functions there is no reduction rule
the normal form of a relation refers to the highest normal form condition that it meets, and hence indicates the degree to which it have been normalized