Data.Repr

Compute least upper bounds (lub / join) of two values

This version uses associated types for HasRepr

Documentation

class HasRepr t r | t -> r where

A data type representation, in terms of standard data types. Requires that unrepr . repr == id.

Methods

repr

Arguments

:: t

-> r

to representation

unrepr

Arguments

:: r

-> t

from representation

Instances

HasRepr [a] (Either () (a, [a]))

HasRepr (Maybe a) (Either () a)

onRepr :: (HasRepr a ra, HasRepr b rb) => (ra -> rb) -> a -> b

Apply a binary function on a repr

onRepr2 :: (HasRepr a ra, HasRepr b rb, HasRepr c rc) => (ra -> rb -> rc) -> a -> b -> c

Apply a binary function on a repr