typedKanren
Safe HaskellNone
LanguageHaskell2010

Kanren.LogicalBase

Description

Logical representations for some base types along with their (orphan) Logical instances.

Synopsis

Primitive types

There are Logical instances for Bool, Char, Int, and Void. They don't require a separate logic representation.

Prisms for Bool

_False' :: forall false true false' p f. (Choice p, Applicative f) => p (Tagged false ()) (f (Tagged false' ())) -> p (Tagged (false, true) Bool) (f (Tagged (false', true) Bool)) Source #

_True' :: forall false true true' p f. (Choice p, Applicative f) => p (Tagged true ()) (f (Tagged true' ())) -> p (Tagged (false, true) Bool) (f (Tagged (false, true') Bool)) Source #

Tuples

For tuples, the logical representation is a tuple too, so they don't need a separate logic type. Currently, there's a Logical instance for 2-tuples only.

Lists

data LogicList a Source #

Constructors

LogicNil 
LogicCons (Term a) (Term [a]) 

Instances

Instances details
NFData (Logic a) => NFData (LogicList a) Source # 
Instance details

Defined in Kanren.LogicalBase

Methods

rnf :: LogicList a -> () #

Generic (LogicList a) Source # 
Instance details

Defined in Kanren.LogicalBase

Associated Types

type Rep (LogicList a) 
Instance details

Defined in Kanren.LogicalBase

type Rep (LogicList a) = D1 ('MetaData "LogicList" "Kanren.LogicalBase" "typedKanren-0.1.0.0-BonIIUJVTtd8qLc7jzuNwH" 'False) (C1 ('MetaCons "LogicNil" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LogicCons" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term [a]))))

Methods

from :: LogicList a -> Rep (LogicList a) x #

to :: Rep (LogicList a) x -> LogicList a #

IsList (LogicList a) Source # 
Instance details

Defined in Kanren.LogicalBase

Associated Types

type Item (LogicList a) 
Instance details

Defined in Kanren.LogicalBase

type Item (LogicList a) = Term a

Methods

fromList :: [Item (LogicList a)] -> LogicList a #

fromListN :: Int -> [Item (LogicList a)] -> LogicList a #

toList :: LogicList a -> [Item (LogicList a)] #

Show (Logic a) => Show (LogicList a) Source #

This instance tries to print the list as a regular one. In case the tail is unknown, the list is printed as [...|_.n], like in Prolog.

Instance details

Defined in Kanren.LogicalBase

Eq (Logic a) => Eq (LogicList a) Source # 
Instance details

Defined in Kanren.LogicalBase

Methods

(==) :: LogicList a -> LogicList a -> Bool #

(/=) :: LogicList a -> LogicList a -> Bool #

type Rep (LogicList a) Source # 
Instance details

Defined in Kanren.LogicalBase

type Rep (LogicList a) = D1 ('MetaData "LogicList" "Kanren.LogicalBase" "typedKanren-0.1.0.0-BonIIUJVTtd8qLc7jzuNwH" 'False) (C1 ('MetaCons "LogicNil" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LogicCons" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term [a]))))
type Item (LogicList a) Source # 
Instance details

Defined in Kanren.LogicalBase

type Item (LogicList a) = Term a

Prisms for lists

_LogicNil :: forall a p f. (Choice p, Applicative f) => p () (f ()) -> p (LogicList a) (f (LogicList a)) Source #

_LogicCons :: forall a1 a2 p f. (Choice p, Applicative f) => p (Term a1, Term [a1]) (f (Term a2, Term [a2])) -> p (LogicList a1) (f (LogicList a2)) Source #

_LogicNil' :: forall a logicNil logicCons logicNil' p f. (Choice p, Applicative f) => p (Tagged logicNil ()) (f (Tagged logicNil' ())) -> p (Tagged (logicNil, logicCons) (LogicList a)) (f (Tagged (logicNil', logicCons) (LogicList a))) Source #

_LogicCons' :: forall a logicNil logicCons logicCons' p f. (Choice p, Applicative f) => p (Tagged logicCons (Term a, Term [a])) (f (Tagged logicCons' (Term a, Term [a]))) -> p (Tagged (logicNil, logicCons) (LogicList a)) (f (Tagged (logicNil, logicCons') (LogicList a))) Source #

Maybe

data LogicMaybe a Source #

Constructors

LogicNothing 
LogicJust (Term a) 

Instances

Instances details
Generic (LogicMaybe a) Source # 
Instance details

Defined in Kanren.LogicalBase

Associated Types

type Rep (LogicMaybe a) 
Instance details

Defined in Kanren.LogicalBase

type Rep (LogicMaybe a) = D1 ('MetaData "LogicMaybe" "Kanren.LogicalBase" "typedKanren-0.1.0.0-BonIIUJVTtd8qLc7jzuNwH" 'False) (C1 ('MetaCons "LogicNothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LogicJust" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term a))))

Methods

from :: LogicMaybe a -> Rep (LogicMaybe a) x #

to :: Rep (LogicMaybe a) x -> LogicMaybe a #

Show (Logic a) => Show (LogicMaybe a) Source # 
Instance details

Defined in Kanren.LogicalBase

Eq (Logic a) => Eq (LogicMaybe a) Source # 
Instance details

Defined in Kanren.LogicalBase

Methods

(==) :: LogicMaybe a -> LogicMaybe a -> Bool #

(/=) :: LogicMaybe a -> LogicMaybe a -> Bool #

type Rep (LogicMaybe a) Source # 
Instance details

Defined in Kanren.LogicalBase

type Rep (LogicMaybe a) = D1 ('MetaData "LogicMaybe" "Kanren.LogicalBase" "typedKanren-0.1.0.0-BonIIUJVTtd8qLc7jzuNwH" 'False) (C1 ('MetaCons "LogicNothing" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LogicJust" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term a))))

Prisms for Maybe

_LogicNothing :: forall a p f. (Choice p, Applicative f) => p () (f ()) -> p (LogicMaybe a) (f (LogicMaybe a)) Source #

_LogicJust :: forall a1 a2 p f. (Choice p, Applicative f) => p (Term a1) (f (Term a2)) -> p (LogicMaybe a1) (f (LogicMaybe a2)) Source #

_LogicNothing' :: forall a logicNothing logicJust logicNothing' p f. (Choice p, Applicative f) => p (Tagged logicNothing ()) (f (Tagged logicNothing' ())) -> p (Tagged (logicNothing, logicJust) (LogicMaybe a)) (f (Tagged (logicNothing', logicJust) (LogicMaybe a))) Source #

_LogicJust' :: forall a logicNothing logicJust logicJust' p f. (Choice p, Applicative f) => p (Tagged logicJust (Term a)) (f (Tagged logicJust' (Term a))) -> p (Tagged (logicNothing, logicJust) (LogicMaybe a)) (f (Tagged (logicNothing, logicJust') (LogicMaybe a))) Source #

Either

data LogicEither a b Source #

Constructors

LogicLeft (Term a) 
LogicRight (Term b) 

Instances

Instances details
Generic (LogicEither a b) Source # 
Instance details

Defined in Kanren.LogicalBase

Associated Types

type Rep (LogicEither a b) 
Instance details

Defined in Kanren.LogicalBase

type Rep (LogicEither a b) = D1 ('MetaData "LogicEither" "Kanren.LogicalBase" "typedKanren-0.1.0.0-BonIIUJVTtd8qLc7jzuNwH" 'False) (C1 ('MetaCons "LogicLeft" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term a))) :+: C1 ('MetaCons "LogicRight" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term b))))

Methods

from :: LogicEither a b -> Rep (LogicEither a b) x #

to :: Rep (LogicEither a b) x -> LogicEither a b #

(Show (Logic a), Show (Logic b)) => Show (LogicEither a b) Source # 
Instance details

Defined in Kanren.LogicalBase

Methods

showsPrec :: Int -> LogicEither a b -> ShowS #

show :: LogicEither a b -> String #

showList :: [LogicEither a b] -> ShowS #

(Eq (Logic a), Eq (Logic b)) => Eq (LogicEither a b) Source # 
Instance details

Defined in Kanren.LogicalBase

Methods

(==) :: LogicEither a b -> LogicEither a b -> Bool #

(/=) :: LogicEither a b -> LogicEither a b -> Bool #

type Rep (LogicEither a b) Source # 
Instance details

Defined in Kanren.LogicalBase

type Rep (LogicEither a b) = D1 ('MetaData "LogicEither" "Kanren.LogicalBase" "typedKanren-0.1.0.0-BonIIUJVTtd8qLc7jzuNwH" 'False) (C1 ('MetaCons "LogicLeft" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term a))) :+: C1 ('MetaCons "LogicRight" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term b))))

Prisms for Either

_LogicLeft :: forall a1 b a2 p f. (Choice p, Applicative f) => p (Term a1) (f (Term a2)) -> p (LogicEither a1 b) (f (LogicEither a2 b)) Source #

_LogicRight :: forall a b1 b2 p f. (Choice p, Applicative f) => p (Term b1) (f (Term b2)) -> p (LogicEither a b1) (f (LogicEither a b2)) Source #

_LogicLeft' :: forall a b logicLeft logicRight logicLeft' p f. (Choice p, Applicative f) => p (Tagged logicLeft (Term a)) (f (Tagged logicLeft' (Term a))) -> p (Tagged (logicLeft, logicRight) (LogicEither a b)) (f (Tagged (logicLeft', logicRight) (LogicEither a b))) Source #

_LogicRight' :: forall a b logicLeft logicRight logicRight' p f. (Choice p, Applicative f) => p (Tagged logicRight (Term b)) (f (Tagged logicRight' (Term b))) -> p (Tagged (logicLeft, logicRight) (LogicEither a b)) (f (Tagged (logicLeft, logicRight') (LogicEither a b))) Source #

Orphan instances

Logical Void Source # 
Instance details

Associated Types

type Logic Void 
Instance details

Defined in Kanren.LogicalBase

type Logic Void = Void
Logical () Source # 
Instance details

Associated Types

type Logic () 
Instance details

Defined in Kanren.LogicalBase

type Logic () = ()

Methods

unify :: Logic () -> Logic () -> State -> Maybe State Source #

walk :: State -> Logic () -> Logic () Source #

occursCheck :: VarId b -> Logic () -> State -> Bool Source #

inject :: () -> Logic () Source #

extract :: Logic () -> Maybe () Source #

Logical Bool Source # 
Instance details

Associated Types

type Logic Bool 
Instance details

Defined in Kanren.LogicalBase

type Logic Bool = Bool
Logical Char Source # 
Instance details

Associated Types

type Logic Char 
Instance details

Defined in Kanren.LogicalBase

type Logic Char = Char
Logical Int Source # 
Instance details

Associated Types

type Logic Int 
Instance details

Defined in Kanren.LogicalBase

type Logic Int = Int
Logical a => Logical (Maybe a) Source # 
Instance details

Associated Types

type Logic (Maybe a) 
Instance details

Defined in Kanren.LogicalBase

type Logic (Maybe a) = LogicMaybe a
Logical a => Logical [a] Source # 
Instance details

Associated Types

type Logic [a] 
Instance details

Defined in Kanren.LogicalBase

type Logic [a] = LogicList a

Methods

unify :: Logic [a] -> Logic [a] -> State -> Maybe State Source #

walk :: State -> Logic [a] -> Logic [a] Source #

occursCheck :: VarId b -> Logic [a] -> State -> Bool Source #

inject :: [a] -> Logic [a] Source #

extract :: Logic [a] -> Maybe [a] Source #

(Logical a, Logical b) => Logical (Either a b) Source # 
Instance details

Associated Types

type Logic (Either a b) 
Instance details

Defined in Kanren.LogicalBase

type Logic (Either a b) = LogicEither a b

Methods

unify :: Logic (Either a b) -> Logic (Either a b) -> State -> Maybe State Source #

walk :: State -> Logic (Either a b) -> Logic (Either a b) Source #

occursCheck :: VarId b0 -> Logic (Either a b) -> State -> Bool Source #

inject :: Either a b -> Logic (Either a b) Source #

extract :: Logic (Either a b) -> Maybe (Either a b) Source #

(Logical a, Logical b) => Logical (a, b) Source # 
Instance details

Associated Types

type Logic (a, b) 
Instance details

Defined in Kanren.LogicalBase

type Logic (a, b) = (Term a, Term b)

Methods

unify :: Logic (a, b) -> Logic (a, b) -> State -> Maybe State Source #

walk :: State -> Logic (a, b) -> Logic (a, b) Source #

occursCheck :: VarId b0 -> Logic (a, b) -> State -> Bool Source #

inject :: (a, b) -> Logic (a, b) Source #

extract :: Logic (a, b) -> Maybe (a, b) Source #