#RProxy Source

data RProxy (row :: Row Type)


#RLProxy Source

data RLProxy (rowList :: RowList)


#ListToRow Source

class ListToRow (list :: RowList) (row :: Row Type) | list -> row

Convert a RowList to a row of types. The inverse of this operation is RowToList.


#RowListRemove Source

class RowListRemove (label :: Symbol) (input :: RowList) (output :: RowList) | label input -> output

Remove all occurences of a given label from a RowList


#RowListSet Source

class RowListSet (label :: Symbol) (typ :: Type) (input :: RowList) (output :: RowList) | label typ input -> output

Add a label to a RowList after removing other occurences.


#RowListNub Source

class RowListNub (input :: RowList) (output :: RowList) | input -> output

Remove label duplicates, keeps earlier occurrences.


#RowListAppend Source

class RowListAppend (lhs :: RowList) (rhs :: RowList) (out :: RowList) | lhs rhs -> out


#RowApply Source

type RowApply (f :: Row Type -> Row Type) (a :: Row Type) = f a

Type application for rows.

#type (+) Source

Operator alias for Type.Row.RowApply (right-associative / precedence 0)

Applies a type alias of open rows to a set of rows. The primary use case this operator is as convenient sugar for combining open rows without parentheses.

type Rows1 r = (a :: Int, b :: String | r)
type Rows2 r = (c :: Boolean | r)
type Rows3 r = (Rows1 + Rows2 + r)
type Rows4 r = (d :: String | Rows1 + Rows2 + r)

Re-exports from Prim.Row


class Cons (label :: Symbol) (a :: Type) (tail :: Row Type) (row :: Row Type) | label a tail -> row, label row -> a tail

The Cons type class is a 4-way relation which asserts that one row of types can be obtained from another by inserting a new label/type pair on the left.


class Lacks (label :: Symbol) (row :: Row Type) 

The Lacks type class asserts that a label does not occur in a given row.


class Nub (original :: Row Type) (nubbed :: Row Type) | original -> nubbed

The Nub type class is used to remove duplicate labels from rows.


class Union (left :: Row Type) (right :: Row Type) (union :: Row Type) | left right -> union, right union -> left, union left -> right

The Union type class is used to compute the union of two rows of types (left-biased, including duplicates).

The third type argument represents the union of the first two.

Re-exports from Prim.RowList


data Nil :: RowList

The empty RowList.


data Cons :: Symbol -> Type -> RowList -> RowList

Constructs a new RowList from a label, a type, and an existing tail RowList. E.g: Cons "x" Int (Cons "y" Int Nil).


class RowToList (row :: Row Type) (list :: RowList) | row -> list

Compiler solved type class for generating a RowList from a closed row of types. Entries are sorted by label and duplicates are preserved in the order they appeared in the row.


data RowList :: Type

A type level list representation of a row of types.