A relation R satisfying
f R g <=> For all a, b, a R b => f a R g b
This definition, by Plotkin, can be used to extend the definition of a relation on the types of a and b to a relation on functions.
- Logical shift
programming (Either shift left logical or shift right logical) Machine-level operations available on nearly all processors which move each bit in a word one or more bit positions in the given direction. A left shift moves the bits to more significant positions (like multiplying by two), a right shift moves them to less significant positions […]
- Logical shift left
- Logical shift right
noun 1. (def 10a). noun 1. another name for disjunction (sense 3)