Safe Haskell	None
Language	GHC2021

Rerefined.Predicate.Logical.Nand

Synopsis

Documentation

data Nand (l :: k) (r :: k1) Source #

NAND logic gate. Also called the Sheffer stroke, or non-conjunction.

Instances details

(Predicate l, Predicate r) => Predicate (Nand l r :: Type) Source #	Precedence of 3 (matching `&&`).
Instance details Defined in Rerefined.Predicate.Logical.Nand
(Refine l a, Refine r a, KnownPredicateName (Nand l r)) => Refine (Nand l r :: Type) a Source #
Instance details Defined in Rerefined.Predicate.Logical.Nand Methods validate :: Proxy# (Nand l r) -> a -> Maybe RefineFailure Source #
type PredicateName d (Nand l r :: Type) Source #
Instance details Defined in Rerefined.Predicate.Logical.Nand type PredicateName d (Nand l r :: Type) = PredicateNameBOp " \8892 " 3 d l r