Copyright	(C) 2017-18 Jakub Daniel
License	BSD-style (see the file LICENSE)
Maintainer	Jakub Daniel <jakub.daniel@protonmail.com>
Stability	experimental
Safe Haskell	Safe
Language	Haskell2010

Data.Expression.Utils.Indexed.Eq

Description

Synopsis

Documentation

class IEq a where Source #

Indexed types that can be equated

Minimal complete definition

Methods

ieq :: forall j. a j -> a j -> Bool Source #

Instances

IEq1 i f => IEq i (IFix i f) Source #
Methods ieq :: a j -> a j -> Bool Source #

class IEq1 f where Source #

Type constructors (usually functors) that produce types that can be equated

Minimal complete definition

Methods

ieq1 :: forall a j. IEq a => f a j -> f a j -> Bool Source #

Instances

IEq1 Sort ArrayF Source #
Methods ieq1 :: IEq ArrayF a => f a j -> f a j -> Bool Source #
IEq1 Sort ArithmeticF Source #
Methods ieq1 :: IEq ArithmeticF a => f a j -> f a j -> Bool Source #
IEq1 Sort NegationF Source #
Methods ieq1 :: IEq NegationF a => f a j -> f a j -> Bool Source #
IEq1 Sort DisjunctionF Source #
Methods ieq1 :: IEq DisjunctionF a => f a j -> f a j -> Bool Source #
IEq1 Sort ConjunctionF Source #
Methods ieq1 :: IEq ConjunctionF a => f a j -> f a j -> Bool Source #
IEq1 Sort (EqualityF Sort) Source #
Methods ieq1 :: IEq (EqualityF Sort) a => f a j -> f a j -> Bool Source #
IEq1 Sort (ExistentialF v) Source #
Methods ieq1 :: IEq (ExistentialF v) a => f a j -> f a j -> Bool Source #
IEq1 Sort (UniversalF v) Source #
Methods ieq1 :: IEq (UniversalF v) a => f a j -> f a j -> Bool Source #
IEq1 Sort (VarF (Sort -> *)) Source #
Methods ieq1 :: IEq (VarF (Sort -> *)) a => f a j -> f a j -> Bool Source #
(IEq1 i f, IEq1 i g) => IEq1 i ((:+:) i (i -> *) f g) Source #
Methods ieq1 :: IEq ((i :+: (i -> *)) f g) a => f a j -> f a j -> Bool Source #