 | lub-0.0.3: least upper bounds -- information merging | Source code | Contents | Index |
| Data.Repr |
|
Compute least upper bounds (lub / join) of two values
This version uses associated types for HasRepr
| class HasRepr t r | t -> r where | ||
| ||
| onRepr :: (HasRepr a ra, HasRepr b rb) => (ra -> rb) -> a -> b | ||
| onRepr2 :: (HasRepr a ra, HasRepr b rb, HasRepr c rc) => (ra -> rb -> rc) -> a -> b -> c |
| class HasRepr t r | t -> r where | Source |
| A data type representation, in terms of standard data types. Requires that unrepr . repr == id. | |||||||||||||||||
| Methods | |||||||||||||||||
| |||||||||||||||||
 Instances | |||||||||||||||||
| onRepr :: (HasRepr a ra, HasRepr b rb) => (ra -> rb) -> a -> b | Source |
| onRepr2 :: (HasRepr a ra, HasRepr b rb, HasRepr c rc) => (ra -> rb -> rc) -> a -> b -> c | Source |