Lines Matching refs:equality

65 lexicographical equality 
73 Lexicographical equality is stronger than the equality
87 the subset relation and the equality on elements.
92 distinguish between lexicographical equality 
93 `operator ==` and equality of elements `is_element_equal`,
117 The induced equivalence is the equality of elements that
135 the stronger lexicographical equality (`operator ==`)
137 element equality `is_element_equal`. Throughout this
138 chapter we will denote element equality as `=e=` instead
201 Not all instances of distributivity laws hold for lexicographical equality.
202 Therefore they are denoted using a /variable/ equality `=v=` below.
215 used equality relation.
234 element equality (denoted as `=e=`):
239 are valid for lexicographical equality (demoted as `==`) as well.
272 Again not all law instances are valid for lexicographical equality.
273 The second instantiations only holds for element equality, if
283 lexicographical equality.
403 # Using a different equality, called distinct equality in the laws
404   to validate. Distinct equality only 
413 identity elements. Distinct equality is implemented by a non member function
415 distinct equality in pseudocode and law denotations is denoted
442 As expected, Inversion only holds for distinct equality,
466 holds for lexicographical equality.
669 equality relation `==` as this was the case for
680 with element equality `=e=`, which is not a big constrained, because
681 only element equality is required.
685 is valid for element equality. All maps having the /identity enricher/
686 Trait are associative wrt. lexicographical equality `==`.