constrained-generators-0.2.0.0: Framework for generating constrained random data using a subset of first order logic
Safe HaskellSafe-Inferred
LanguageHaskell2010

Constrained.Core

Documentation

data Var a Source #

Constructors

Var 

Fields

Instances

Instances details
Show (Var a) Source # 
Instance details

Defined in Constrained.Core

Methods

showsPrec ∷ Int → Var a → ShowS

show ∷ Var a → String

showList ∷ [Var a] → ShowS

Typeable a ⇒ Rename (Var a) Source # 
Instance details

Defined in Constrained.Core

Methods

rename ∷ Typeable x ⇒ Var x → Var x → Var a → Var a Source #

Eq (Var a) Source # 
Instance details

Defined in Constrained.Core

Methods

(==) ∷ Var a → Var a → Bool

(/=) ∷ Var a → Var a → Bool

Ord (Var a) Source # 
Instance details

Defined in Constrained.Core

Methods

compare ∷ Var a → Var a → Ordering

(<) ∷ Var a → Var a → Bool

(<=) ∷ Var a → Var a → Bool

(>) ∷ Var a → Var a → Bool

(>=) ∷ Var a → Var a → Bool

max ∷ Var a → Var a → Var a

min ∷ Var a → Var a → Var a

Pretty (Var a) Source # 
Instance details

Defined in Constrained.Base

Methods

pretty ∷ Var a → Doc ann Source #

prettyList ∷ [Var a] → Doc ann Source #

eqVar ∷ ∀ a a'. (Typeable a, Typeable a') ⇒ Var a → Var a' → Maybe (a :~: a') Source #

class Rename a where Source #

Methods

rename ∷ Typeable x ⇒ Var x → Var x → a → a Source #

Instances

Instances details
Rename () Source # 
Instance details

Defined in Constrained.Core

Methods

rename ∷ Typeable x ⇒ Var x → Var x → () → () Source #

Rename (Name f) Source # 
Instance details

Defined in Constrained.Base

Methods

rename ∷ Typeable x ⇒ Var x → Var x → Name f → Name f Source #

Rename (Pred fn) Source # 
Instance details

Defined in Constrained.Base

Methods

rename ∷ Typeable x ⇒ Var x → Var x → Pred fn → Pred fn Source #

Typeable a ⇒ Rename (Var a) Source # 
Instance details

Defined in Constrained.Core

Methods

rename ∷ Typeable x ⇒ Var x → Var x → Var a → Var a Source #

(Ord a, Rename a) ⇒ Rename (Set a) Source # 
Instance details

Defined in Constrained.Core

Methods

rename ∷ Typeable x ⇒ Var x → Var x → Set a → Set a Source #

(Functor t, Rename a) ⇒ Rename (t a) Source # 
Instance details

Defined in Constrained.Core

Methods

rename ∷ Typeable x ⇒ Var x → Var x → t a → t a Source #

Rename (Binder fn a) Source # 
Instance details

Defined in Constrained.Base

Methods

rename ∷ Typeable x ⇒ Var x → Var x → Binder fn a → Binder fn a Source #

Rename (Term fn a) Source # 
Instance details

Defined in Constrained.Base

Methods

rename ∷ Typeable x ⇒ Var x → Var x → Term fn a → Term fn a Source #

Rename (f a) ⇒ Rename (Weighted f a) Source # 
Instance details

Defined in Constrained.Base

Methods

rename ∷ Typeable x ⇒ Var x → Var x → Weighted f a → Weighted f a Source #

(Rename a, Rename b) ⇒ Rename (a, b) Source # 
Instance details

Defined in Constrained.Core

Methods

rename ∷ Typeable x ⇒ Var x → Var x → (a, b) → (a, b) Source #

(∀ a. Rename (f a)) ⇒ Rename (List f as) Source # 
Instance details

Defined in Constrained.Core

Methods

rename ∷ Typeable x ⇒ Var x → Var x → List f as → List f as Source #

freshVar ∷ Var a → Set Int → Var a Source #

freshen ∷ (Typeable a, Rename t) ⇒ Var a → t → Set Int → (Var a, t) Source #

data Value a where Source #

Constructors

Value ∷ Show a ⇒ !a → Value a 

Instances

Instances details
Show (Value a) Source # 
Instance details

Defined in Constrained.Core

Methods

showsPrec ∷ Int → Value a → ShowS

show ∷ Value a → String

showList ∷ [Value a] → ShowS

Eq a ⇒ Eq (Value a) Source # 
Instance details

Defined in Constrained.Core

Methods

(==) ∷ Value a → Value a → Bool

(/=) ∷ Value a → Value a → Bool

Ord a ⇒ Ord (Value a) Source # 
Instance details

Defined in Constrained.Core

Methods

compare ∷ Value a → Value a → Ordering

(<) ∷ Value a → Value a → Bool

(<=) ∷ Value a → Value a → Bool

(>) ∷ Value a → Value a → Bool

(>=) ∷ Value a → Value a → Bool

max ∷ Value a → Value a → Value a

min ∷ Value a → Value a → Value a

unValue ∷ Value a → a Source #

data Evidence c where Source #

Constructors

Evidence ∷ c ⇒ Evidence c 

unionWithMaybe ∷ (a → a → a) → Maybe a → Maybe a → Maybe a Source #