expressions-0.1.1: Expressions and Formulas a la carte

Data.Expression.Equality

Description

Synopsis

# Documentation

data EqualityF a s where Source #

A functor representing an equality predicate between two expressions of matching sort

Constructors

 Equals :: Sing s -> a s -> a s -> EqualityF a BooleanSort

Instances

 IShow Sort k (EqualityF k) Source # Methodsishow :: f (Const k String) i -> Const (EqualityF k) String i Source # Source # Methodsifold :: Monoid m => f (Const (EqualityF Sort) m) i' -> Const (EqualityF Sort) m i' Source # Source # Methodsieq1 :: IEq (EqualityF Sort) a => f a j -> f a j -> Bool Source # Source # Methodsimap :: (forall i'. a i' -> b i') -> forall i'. f a i' -> f b i' Source #index :: f a i' -> Sing (EqualityF Sort) i' Source # Source # Methodsitraverse :: Applicative f => (forall i'. a i' -> f (b i')) -> forall i'. t a i' -> f (t b i') Source # # Methods # Methods # Methods # Methods # Methods # Methods # Methods # Methods # Methods # Methods # # # # # # Methods # Methods # Methods # Methods # Methods # Methods # Methods # Methods # Methods # Methods # # # # # Source # Methods Source # Methods Source # Methods Source # Methods Source # Methods (:<:) Sort (EqualityF Sort) f => Parseable ((k -> *) -> Sort -> *) (EqualityF k) f Source # Methodsparser :: Proxy (EqualityF k) f -> Parser (DynamicallySorted g) -> Parser (DynamicallySorted g) Source #

(.=.) :: forall f s. (EqualityF :<: f, SingI s) => IFix f s -> IFix f s -> IFix f BooleanSort infix 7 Source #

A smart constructor for an equality predicate