logic-TPTP-0.4.4.0: Import, export etc. for TPTP, a syntax for first-order logic

Codec.TPTP.Diff

Synopsis

# Documentation

class Diffable a b | a -> b where Source #

Minimal complete definition

diff

Methods

diff :: a -> a -> b Source #

Instances

 Source # Methods Source # Methods

data DiffResult d Source #

Constructors

 Same Both arguments are the same. SameHead d The arguments are recursive expressions of the same form, but their subterms differ. Return a "decorated" term that shows where the differences are Differ d d The arguments differ and are not of similar form (don't recurse) DontCare

Instances

 Source # Methodsfmap :: (a -> b) -> DiffResult a -> DiffResult b #(<\$) :: a -> DiffResult b -> DiffResult a # Source # Methodspretty :: F0Diff -> Doc #prettyList :: [F0Diff] -> Doc # Source # Methodspretty :: T0Diff -> Doc #prettyList :: [T0Diff] -> Doc # Source # Methods Source # Methods Eq d => Eq (DiffResult d) Source # Methods(==) :: DiffResult d -> DiffResult d -> Bool #(/=) :: DiffResult d -> DiffResult d -> Bool # Data d => Data (DiffResult d) Source # Methodsgfoldl :: (forall a b. Data a => c (a -> b) -> a -> c b) -> (forall g. g -> c g) -> DiffResult d -> c (DiffResult d) #gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DiffResult d) #dataCast1 :: Typeable (* -> *) t => (forall a. Data a => c (t a)) -> Maybe (c (DiffResult d)) #dataCast2 :: Typeable (* -> * -> *) t => (forall a e. (Data a, Data e) => c (t a e)) -> Maybe (c (DiffResult d)) #gmapT :: (forall b. Data b => b -> b) -> DiffResult d -> DiffResult d #gmapQl :: (r -> r' -> r) -> r -> (forall a. Data a => a -> r') -> DiffResult d -> r #gmapQr :: (r' -> r -> r) -> r -> (forall a. Data a => a -> r') -> DiffResult d -> r #gmapQ :: (forall a. Data a => a -> u) -> DiffResult d -> [u] #gmapQi :: Int -> (forall a. Data a => a -> u) -> DiffResult d -> u #gmapM :: Monad m => (forall a. Data a => a -> m a) -> DiffResult d -> m (DiffResult d) #gmapMp :: MonadPlus m => (forall a. Data a => a -> m a) -> DiffResult d -> m (DiffResult d) #gmapMo :: MonadPlus m => (forall a. Data a => a -> m a) -> DiffResult d -> m (DiffResult d) # Ord d => Ord (DiffResult d) Source # Methodscompare :: DiffResult d -> DiffResult d -> Ordering #(<) :: DiffResult d -> DiffResult d -> Bool #(<=) :: DiffResult d -> DiffResult d -> Bool #(>) :: DiffResult d -> DiffResult d -> Bool #(>=) :: DiffResult d -> DiffResult d -> Bool #max :: DiffResult d -> DiffResult d -> DiffResult d #min :: DiffResult d -> DiffResult d -> DiffResult d # Read d => Read (DiffResult d) Source # MethodsreadsPrec :: Int -> ReadS (DiffResult d) # Source # MethodsshowList :: [T DiffResult] -> ShowS # Source # MethodsshowList :: [F DiffResult] -> ShowS # Show d => Show (DiffResult d) Source # MethodsshowsPrec :: Int -> DiffResult d -> ShowS #show :: DiffResult d -> String #showList :: [DiffResult d] -> ShowS # Source # MethodsprettyList :: [T DiffResult] -> Doc # Source # MethodsprettyList :: [F DiffResult] -> Doc # Source # MethodsprettyList :: [WithEnclosing (T DiffResult)] -> Doc # Source # MethodsprettyList :: [WithEnclosing (F DiffResult)] -> Doc # Source # Methods Source # Methods

isSame :: forall t. DiffResult t -> Bool Source #

Less random generator for generating formulae suitable for testing diff