Overloaded.Lists.Bidi

Another way to desugar list literals.

An explicit list expression, e.g. [1, True] is desugared to

cons 1 (cons True nil)

This desugaring uses bidirectional functional dependencies to make cons infer more. The trade-off is that we can have strictly less instances.

Enabled with:

{-# OPTIONS_GHC -fplugin=Overloaded
                -fplugin-opt=Overloaded:Lists=Overloaded.Lists.Bidi.nil=Overloaded.Lists.Bidi.cons

Documentation

nil :: Nil a => a

class Cons x ys zs => Cons x ys zs | zs -> x ys, x ys -> zs where

Bidirectional class for Cons :.

Since: 0.2

Minimal complete definition

Nothing

Methods

cons :: x -> ys -> zs infixr 5

Instances

Cons Int IntSet IntSet

Defined in Overloaded.Lists.Bidi

Methods

cons :: Int -> IntSet -> IntSet

(a ~ b, b ~ c) => Cons a (Seq b) (Seq c)

Defined in Overloaded.Lists.Bidi

Methods

cons :: a -> Seq b -> Seq c

(Ord a, a ~ b, b ~ c) => Cons a (Set a) (Set a)

Defined in Overloaded.Lists.Bidi

Methods

cons :: a -> Set a -> Set a

(a ~ b, b ~ c) => Cons a [b] [c]

Defined in Overloaded.Lists.Bidi

Methods

cons :: a -> [b] -> [c]

(a ~ b, b ~ c, m ~ S n) => Cons a (Vec n b) (Vec m c)

Defined in Overloaded.Lists.Bidi

Methods

cons :: a -> Vec n b -> Vec m c

(f ~ g, g ~ h, xxs ~ (x ': xs)) => Cons (f x) (NP g xs) (NP h xxs)

Defined in Overloaded.Lists.Bidi

Methods

cons :: f x -> NP g xs -> NP h xxs

(i ~ Int, a ~ b, b ~ c) => Cons (i, a) (IntMap b) (IntMap c)

Defined in Overloaded.Lists.Bidi

Methods

cons :: (i, a) -> IntMap b -> IntMap c

(Ord k, k ~ k1, k ~ k2, v ~ v1, v ~ v2) => Cons (k, v) (Map k1 v1) (Map k2 v2)

Defined in Overloaded.Lists.Bidi

Methods

cons :: (k, v) -> Map k1 v1 -> Map k2 v2

(f ~ g, g ~ h, xsxss ~ (xs ': xss)) => Cons (NP f xs) (POP g xss) (POP h xsxss)

Defined in Overloaded.Lists.Bidi

Methods

cons :: NP f xs -> POP g xss -> POP h xsxss

fromList :: (Nil xs, Cons x xs xs) => [x] -> xs

Since: 0.1.3