| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Kanren.LogicalBase
Description
Logical representations for some base types along with their (orphan)
Logical instances.
Synopsis
- _False :: Prism' Bool ()
- _True :: Prism' 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))
- _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))
- data LogicList a
- _LogicNil :: forall a p f. (Choice p, Applicative f) => p () (f ()) -> p (LogicList a) (f (LogicList a))
- _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))
- _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)))
- _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)))
- data LogicMaybe a
- = LogicNothing
- | LogicJust (Term a)
- _LogicNothing :: forall a p f. (Choice p, Applicative f) => p () (f ()) -> p (LogicMaybe a) (f (LogicMaybe a))
- _LogicJust :: forall a1 a2 p f. (Choice p, Applicative f) => p (Term a1) (f (Term a2)) -> p (LogicMaybe a1) (f (LogicMaybe a2))
- _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)))
- _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)))
- data LogicEither a b
- = LogicLeft (Term a)
- | LogicRight (Term b)
- _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))
- _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))
- _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)))
- _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)))
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
Instances
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
| Generic (LogicMaybe a) Source # | |||||
Defined in Kanren.LogicalBase Associated Types
| |||||
| Show (Logic a) => Show (LogicMaybe a) Source # | |||||
Defined in Kanren.LogicalBase Methods showsPrec :: Int -> LogicMaybe a -> ShowS # show :: LogicMaybe a -> String # showList :: [LogicMaybe a] -> ShowS # | |||||
| Eq (Logic a) => Eq (LogicMaybe a) Source # | |||||
Defined in Kanren.LogicalBase | |||||
| type Rep (LogicMaybe a) Source # | |||||
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
| Generic (LogicEither a b) Source # | |||||
Defined in Kanren.LogicalBase Associated Types
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 # | |||||
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 # | |||||
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 # | |||||
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 # | |||||
| Logical () Source # | |||||
Associated Types
| |||||
| Logical Bool Source # | |||||
| Logical Char Source # | |||||
| Logical Int Source # | |||||
| Logical a => Logical (Maybe a) Source # | |||||
Associated Types
| |||||
| Logical a => Logical [a] Source # | |||||
Associated Types
| |||||
| (Logical a, Logical b) => Logical (Either a b) Source # | |||||
Associated Types
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 # | |||||
Associated Types
| |||||