logic-classes 1.5.2 → 1.5.3
raw patch · 3 files changed
+7/−4 lines, 3 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.Boolean: instance Eq Literal
- Data.Boolean: instance Show Boolean
- Data.Boolean: instance Show Literal
- Data.Boolean.SatSolver: instance Show SatSolver
- Data.Logic.Classes.Combine: instance Bounded BinOp
- Data.Logic.Classes.Combine: instance Data BinOp
- Data.Logic.Classes.Combine: instance Data formula => Data (Combination formula)
- Data.Logic.Classes.Combine: instance Enum BinOp
- Data.Logic.Classes.Combine: instance Eq BinOp
- Data.Logic.Classes.Combine: instance Eq formula => Eq (Combination formula)
- Data.Logic.Classes.Combine: instance Ord BinOp
- Data.Logic.Classes.Combine: instance Ord formula => Ord (Combination formula)
- Data.Logic.Classes.Combine: instance Pretty BinOp
- Data.Logic.Classes.Combine: instance Read BinOp
- Data.Logic.Classes.Combine: instance Read formula => Read (Combination formula)
- Data.Logic.Classes.Combine: instance Show BinOp
- Data.Logic.Classes.Combine: instance Show formula => Show (Combination formula)
- Data.Logic.Classes.Combine: instance Typeable BinOp
- Data.Logic.Classes.Combine: instance Typeable Combination
- Data.Logic.Classes.Constants: instance Pretty Bool
- Data.Logic.Classes.Equals: instance (Pretty p, Ord p) => Pretty (PredicateName p)
- Data.Logic.Classes.Equals: instance Eq p => Eq (PredicateName p)
- Data.Logic.Classes.Equals: instance Ord p => Ord (PredicateName p)
- Data.Logic.Classes.Equals: instance Show p => Show (PredicateName p)
- Data.Logic.Classes.FirstOrder: instance Bounded Quant
- Data.Logic.Classes.FirstOrder: instance Data Quant
- Data.Logic.Classes.FirstOrder: instance Enum Quant
- Data.Logic.Classes.FirstOrder: instance Eq Quant
- Data.Logic.Classes.FirstOrder: instance Ord Quant
- Data.Logic.Classes.FirstOrder: instance Read Quant
- Data.Logic.Classes.FirstOrder: instance SafeCopy Quant
- Data.Logic.Classes.FirstOrder: instance Show Quant
- Data.Logic.Classes.FirstOrder: instance Typeable Quant
- Data.Logic.Classes.Pretty: instance Pretty String
- Data.Logic.Classes.Propositional: instance SafeCopy BinOp
- Data.Logic.Classes.Propositional: instance SafeCopy formula0 => SafeCopy (Combination formula0)
- Data.Logic.Failing: instance Data a => Data (Failing a)
- Data.Logic.Failing: instance Eq a => Eq (Failing a)
- Data.Logic.Failing: instance Monad Failing
- Data.Logic.Failing: instance Ord a => Ord (Failing a)
- Data.Logic.Failing: instance Read a => Read (Failing a)
- Data.Logic.Failing: instance Typeable Failing
- Data.Logic.HUnit: instance IsString Function
- Data.Logic.Harrison.DP: instance Eq TrailMix
- Data.Logic.Harrison.DP: instance NumAtom (Atom N)
- Data.Logic.Harrison.DP: instance Ord TrailMix
- Data.Logic.Harrison.DefCNF: instance NumAtom (Atom N)
- Data.Logic.Harrison.PropExamples: instance Eq a => Eq (Atom a)
- Data.Logic.Harrison.PropExamples: instance HasFixity (Atom N)
- Data.Logic.Harrison.PropExamples: instance Ord a => Ord (Atom a)
- Data.Logic.Harrison.PropExamples: instance Pretty (Atom N)
- Data.Logic.Harrison.PropExamples: instance Show (Formula (Atom Int))
- Data.Logic.Harrison.PropExamples: instance Show a => Show (Atom a)
- Data.Logic.Instances.Chiou: instance (Constants p, Eq (NormalSentence v p f)) => Constants (NormalSentence v p f)
- Data.Logic.Instances.Chiou: instance (Constants p, Eq (Sentence v p f)) => Constants (Sentence v p f)
- Data.Logic.Instances.Chiou: instance (Data v, Data f) => Data (CTerm v f)
- Data.Logic.Instances.Chiou: instance (Data v, Data f) => Data (NormalTerm v f)
- Data.Logic.Instances.Chiou: instance (Data v, Data p, Data f) => Data (NormalSentence v p f)
- Data.Logic.Instances.Chiou: instance (Data v, Data p, Data f) => Data (Sentence v p f)
- Data.Logic.Instances.Chiou: instance (Eq v, Eq f) => Eq (CTerm v f)
- Data.Logic.Instances.Chiou: instance (Eq v, Eq f) => Eq (NormalTerm v f)
- Data.Logic.Instances.Chiou: instance (Eq v, Eq p, Eq f) => Eq (ConjunctiveNormalForm v p f)
- Data.Logic.Instances.Chiou: instance (Eq v, Eq p, Eq f) => Eq (NormalSentence v p f)
- Data.Logic.Instances.Chiou: instance (Eq v, Eq p, Eq f) => Eq (Sentence v p f)
- Data.Logic.Instances.Chiou: instance (FirstOrderFormula (Sentence v p f) (Sentence v p f) v, Variable v, Predicate p, Function f v) => Pretty (Sentence v p f)
- Data.Logic.Instances.Chiou: instance (Formula (NormalSentence v p f) (NormalSentence v p f), Combinable (NormalSentence v p f), Predicate p, Function f v, Variable v) => HasFixity (NormalSentence v p f)
- Data.Logic.Instances.Chiou: instance (Formula (NormalSentence v p f) (NormalSentence v p f), Combinable (NormalSentence v p f), Term (NormalTerm v f) v f, Variable v, Predicate p, Function f v) => FirstOrderFormula (NormalSentence v p f) (NormalSentence v p f) v
- Data.Logic.Instances.Chiou: instance (Formula (NormalSentence v p f) (NormalSentence v p f), Variable v, Predicate p, Function f v, Combinable (NormalSentence v p f)) => Pretty (NormalSentence v p f)
- Data.Logic.Instances.Chiou: instance (Formula (Sentence v p f) (Sentence v p f), Predicate p, Function f v, Variable v) => HasFixity (Sentence v p f)
- Data.Logic.Instances.Chiou: instance (Formula (Sentence v p f) (Sentence v p f), Variable v, Predicate p, Function f v) => FirstOrderFormula (Sentence v p f) (Sentence v p f) v
- Data.Logic.Instances.Chiou: instance (Formula (Sentence v p f) (Sentence v p f), Variable v, Predicate p, Function f v, Combinable (Sentence v p f)) => PropositionalFormula (Sentence v p f) (Sentence v p f)
- Data.Logic.Instances.Chiou: instance (Ord v, Ord f) => Ord (CTerm v f)
- Data.Logic.Instances.Chiou: instance (Ord v, Ord f) => Ord (NormalTerm v f)
- Data.Logic.Instances.Chiou: instance (Ord v, Ord p, Ord f) => Combinable (Sentence v p f)
- Data.Logic.Instances.Chiou: instance (Ord v, Ord p, Ord f) => Ord (NormalSentence v p f)
- Data.Logic.Instances.Chiou: instance (Ord v, Ord p, Ord f) => Ord (Sentence v p f)
- Data.Logic.Instances.Chiou: instance (Predicate p, Function f v) => Formula (Sentence v p f) (Sentence v p f)
- Data.Logic.Instances.Chiou: instance (Predicate p, Function f v, Combinable (NormalSentence v p f)) => Formula (NormalSentence v p f) (NormalSentence v p f)
- Data.Logic.Instances.Chiou: instance (Variable v, Function f v) => Term (CTerm v f) v f
- Data.Logic.Instances.Chiou: instance (Variable v, Function f v) => Term (NormalTerm v f) v f
- Data.Logic.Instances.Chiou: instance (Variable v, Predicate p, Function f v) => Apply (Sentence v p f) p (CTerm v f)
- Data.Logic.Instances.Chiou: instance Data Connective
- Data.Logic.Instances.Chiou: instance Data Quantifier
- Data.Logic.Instances.Chiou: instance Eq Connective
- Data.Logic.Instances.Chiou: instance Eq Quantifier
- Data.Logic.Instances.Chiou: instance Eq v => Eq (AtomicFunction v)
- Data.Logic.Instances.Chiou: instance IsString (AtomicFunction v)
- Data.Logic.Instances.Chiou: instance Negatable (NormalSentence v p f)
- Data.Logic.Instances.Chiou: instance Negatable (Sentence v p f)
- Data.Logic.Instances.Chiou: instance Ord Connective
- Data.Logic.Instances.Chiou: instance Ord Quantifier
- Data.Logic.Instances.Chiou: instance Predicate p => AtomEq (Sentence v p f) p (CTerm v f)
- Data.Logic.Instances.Chiou: instance Show Connective
- Data.Logic.Instances.Chiou: instance Show Quantifier
- Data.Logic.Instances.Chiou: instance Show v => Show (AtomicFunction v)
- Data.Logic.Instances.Chiou: instance Typeable CTerm
- Data.Logic.Instances.Chiou: instance Typeable Connective
- Data.Logic.Instances.Chiou: instance Typeable NormalSentence
- Data.Logic.Instances.Chiou: instance Typeable NormalTerm
- Data.Logic.Instances.Chiou: instance Typeable Quantifier
- Data.Logic.Instances.Chiou: instance Typeable Sentence
- Data.Logic.Instances.Chiou: instance Variable v => Skolem (AtomicFunction v) v
- Data.Logic.Instances.PropLogic: instance (Combinable (PropForm a), Pretty a, HasFixity a, Ord a) => PropositionalFormula (PropForm a) a
- Data.Logic.Instances.PropLogic: instance (Pretty a, HasFixity a, Ord a) => Formula (PropForm a) a
- Data.Logic.Instances.PropLogic: instance (PropositionalFormula (PropForm atom) atom, HasFixity atom) => HasFixity (PropForm atom)
- Data.Logic.Instances.PropLogic: instance (PropositionalFormula (PropForm atom) atom, Pretty atom, HasFixity atom) => Pretty (PropForm atom)
- Data.Logic.Instances.PropLogic: instance Combinable (PropForm a)
- Data.Logic.Instances.PropLogic: instance Constants (PropForm formula)
- Data.Logic.Instances.PropLogic: instance Negatable (PropForm a)
- Data.Logic.Instances.SatSolver: instance ClauseNormalFormula CNF Literal
- Data.Logic.Instances.SatSolver: instance Data Literal
- Data.Logic.Instances.SatSolver: instance Negatable Literal
- Data.Logic.Instances.SatSolver: instance Ord Literal
- Data.Logic.Instances.SatSolver: instance Typeable Literal
- Data.Logic.KnowledgeBase: instance (Data lit, Ord lit) => Data (Proof lit)
- Data.Logic.KnowledgeBase: instance (Ord lit, Show lit, Literal lit atom, FirstOrderFormula lit atom v) => Show (Proof lit)
- Data.Logic.KnowledgeBase: instance Data ProofResult
- Data.Logic.KnowledgeBase: instance Data a => Data (WithId a)
- Data.Logic.KnowledgeBase: instance Eq ProofResult
- Data.Logic.KnowledgeBase: instance Eq a => Eq (WithId a)
- Data.Logic.KnowledgeBase: instance Eq lit => Eq (Proof lit)
- Data.Logic.KnowledgeBase: instance Ord ProofResult
- Data.Logic.KnowledgeBase: instance Ord a => Ord (WithId a)
- Data.Logic.KnowledgeBase: instance Ord lit => Ord (Proof lit)
- Data.Logic.KnowledgeBase: instance SafeCopy ProofResult
- Data.Logic.KnowledgeBase: instance Show ProofResult
- Data.Logic.KnowledgeBase: instance Show a => Show (WithId a)
- Data.Logic.KnowledgeBase: instance Typeable Proof
- Data.Logic.KnowledgeBase: instance Typeable ProofResult
- Data.Logic.KnowledgeBase: instance Typeable WithId
- Data.Logic.KnowledgeBase: proof :: Proof lit -> Set (ImplicativeForm lit)
- Data.Logic.KnowledgeBase: proofResult :: Proof lit -> ProofResult
- Data.Logic.KnowledgeBase: wiIdent :: WithId a -> Int
- Data.Logic.KnowledgeBase: wiItem :: WithId a -> a
- Data.Logic.Normal.Implicative: instance (Data lit, Ord lit) => Data (ImplicativeForm lit)
- Data.Logic.Normal.Implicative: instance Eq lit => Eq (ImplicativeForm lit)
- Data.Logic.Normal.Implicative: instance Ord lit => Ord (ImplicativeForm lit)
- Data.Logic.Normal.Implicative: instance Show lit => Show (ImplicativeForm lit)
- Data.Logic.Normal.Implicative: instance Typeable ImplicativeForm
- Data.Logic.Normal.Implicative: neg :: ImplicativeForm lit -> Set lit
- Data.Logic.Normal.Implicative: pos :: ImplicativeForm lit -> Set lit
- Data.Logic.Types.Common: instance Variable String
- Data.Logic.Types.FirstOrder: instance (Constants p, Ord v, Ord p, Ord f, Constants (Predicate p (PTerm v f)), Formula (Formula v p f) (Predicate p (PTerm v f))) => Literal (Formula v p f) (Predicate p (PTerm v f))
- Data.Logic.Types.FirstOrder: instance (Data p, Data term) => Data (Predicate p term)
- Data.Logic.Types.FirstOrder: instance (Data p, Data term) => Data (Predicate_v1 p term)
- Data.Logic.Types.FirstOrder: instance (Data v, Data f) => Data (PTerm v f)
- Data.Logic.Types.FirstOrder: instance (Data v, Data p, Data f) => Data (Formula v p f)
- Data.Logic.Types.FirstOrder: instance (Eq p, Eq term) => Eq (Predicate p term)
- Data.Logic.Types.FirstOrder: instance (Eq p, Eq term) => Eq (Predicate_v1 p term)
- Data.Logic.Types.FirstOrder: instance (Eq v, Eq f) => Eq (PTerm v f)
- Data.Logic.Types.FirstOrder: instance (Eq v, Eq p, Eq f) => Eq (Formula v p f)
- Data.Logic.Types.FirstOrder: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), AtomEq (Predicate p (PTerm v f)) p (PTerm v f), Constants (Formula v p f), Variable v, Predicate p, Function f v) => FirstOrderFormula (Formula v p f) (Predicate p (PTerm v f)) v
- Data.Logic.Types.FirstOrder: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), Predicate p, Variable v, Function f v, HasFixity (Predicate p (PTerm v f))) => HasFixity (Formula v p f)
- Data.Logic.Types.FirstOrder: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), Variable v, Predicate p, Function f v) => Pretty (Formula v p f)
- Data.Logic.Types.FirstOrder: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), Variable v, Predicate p, Function f v, Constants (Formula v p f), Combinable (Formula v p f)) => PropositionalFormula (Formula v p f) (Predicate p (PTerm v f))
- Data.Logic.Types.FirstOrder: instance (Ord p, Ord term) => Ord (Predicate p term)
- Data.Logic.Types.FirstOrder: instance (Ord p, Ord term) => Ord (Predicate_v1 p term)
- Data.Logic.Types.FirstOrder: instance (Ord v, Ord f) => Ord (PTerm v f)
- Data.Logic.Types.FirstOrder: instance (Ord v, Ord p, Ord f) => Ord (Formula v p f)
- Data.Logic.Types.FirstOrder: instance (Predicate p, Function f v) => Formula (Formula v p f) (Predicate p (PTerm v f))
- Data.Logic.Types.FirstOrder: instance (Predicate p, Variable v, Function f v) => Atom (Predicate p (PTerm v f)) (PTerm v f) v
- Data.Logic.Types.FirstOrder: instance (Read p, Read term) => Read (Predicate p term)
- Data.Logic.Types.FirstOrder: instance (Read p, Read term) => Read (Predicate_v1 p term)
- Data.Logic.Types.FirstOrder: instance (Read v, Read f) => Read (PTerm v f)
- Data.Logic.Types.FirstOrder: instance (Read v, Read p, Read f) => Read (Formula v p f)
- Data.Logic.Types.FirstOrder: instance (SafeCopy p, SafeCopy term) => Migrate (Predicate p term)
- Data.Logic.Types.FirstOrder: instance (SafeCopy p0, SafeCopy term0) => SafeCopy (Predicate p0 term0)
- Data.Logic.Types.FirstOrder: instance (SafeCopy p0, SafeCopy term0) => SafeCopy (Predicate_v1 p0 term0)
- Data.Logic.Types.FirstOrder: instance (SafeCopy v0, SafeCopy f0) => SafeCopy (PTerm v0 f0)
- Data.Logic.Types.FirstOrder: instance (SafeCopy v0, SafeCopy p0, SafeCopy f0) => SafeCopy (Formula v0 p0 f0)
- Data.Logic.Types.FirstOrder: instance (Show p, Show term) => Show (Predicate p term)
- Data.Logic.Types.FirstOrder: instance (Show p, Show term) => Show (Predicate_v1 p term)
- Data.Logic.Types.FirstOrder: instance (Show v, Show f) => Show (PTerm v f)
- Data.Logic.Types.FirstOrder: instance (Show v, Show p, Show f) => Show (Formula v p f)
- Data.Logic.Types.FirstOrder: instance (Variable v, Function f v) => Term (PTerm v f) v f
- Data.Logic.Types.FirstOrder: instance (Variable v, Pretty v, Predicate p, Pretty p, Function f v, Pretty f) => Pretty (Predicate p (PTerm v f))
- Data.Logic.Types.FirstOrder: instance Constants (Formula v p f) => Combinable (Formula v p f)
- Data.Logic.Types.FirstOrder: instance Constants p => Constants (Formula v p f)
- Data.Logic.Types.FirstOrder: instance Constants p => Constants (Predicate p (PTerm v f))
- Data.Logic.Types.FirstOrder: instance HasFixity (Predicate p term)
- Data.Logic.Types.FirstOrder: instance Negatable (Formula v p f)
- Data.Logic.Types.FirstOrder: instance Predicate p => AtomEq (Predicate p (PTerm v f)) p (PTerm v f)
- Data.Logic.Types.FirstOrder: instance Typeable Formula
- Data.Logic.Types.FirstOrder: instance Typeable PTerm
- Data.Logic.Types.FirstOrder: instance Typeable Predicate
- Data.Logic.Types.FirstOrder: instance Typeable Predicate_v1
- Data.Logic.Types.FirstOrderPublic: instance (Constants (Formula v p f), Predicate p, Variable v, Function f v) => Constants (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance (Data v, Data p, Data f) => Data (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), Constants (Formula v p f), Constants (Formula v p f), Variable v, Predicate p, Function f v) => Combinable (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), Formula (Formula v p f) (Predicate p (PTerm v f)), Predicate p, Function f v, Variable v) => Ord (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), Formula (Formula v p f) (Predicate p (PTerm v f)), Predicate p, Function f v, Variable v, Constants (Predicate p (PTerm v f)), FirstOrderFormula (Formula v p f) (Predicate p (PTerm v f)) v) => Eq (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), Formula (Formula v p f) (Predicate p (PTerm v f)), Pretty v, Show v, Variable v, Pretty p, Show p, Predicate p, Pretty f, Show f, Function f v) => Pretty (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), Formula (Formula v p f) (Predicate p (PTerm v f)), Show v, Show p, Show f, HasFixity (Formula v p f), Variable v, Predicate p, Function f v) => PropositionalFormula (Formula v p f) (Predicate p (PTerm v f))
- Data.Logic.Types.FirstOrderPublic: instance (Formula (Formula v p f) (Predicate p (PTerm v f)), Formula (Formula v p f) (Predicate p (PTerm v f)), Variable v, Predicate p, Function f v) => FirstOrderFormula (Formula v p f) (Predicate p (PTerm v f)) v
- Data.Logic.Types.FirstOrderPublic: instance (Predicate p, Function f v) => Formula (Formula v p f) (Predicate p (PTerm v f))
- Data.Logic.Types.FirstOrderPublic: instance (Predicate p, Function f v) => HasFixity (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance (SafeCopy v0, SafeCopy p0, SafeCopy f0) => SafeCopy (Formula v0 p0 f0)
- Data.Logic.Types.FirstOrderPublic: instance (Show v, Show p, Show f) => Show (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance Bijection (Combination (Formula v p f)) (Combination (Formula v p f))
- Data.Logic.Types.FirstOrderPublic: instance Bijection (Formula v p f) (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance Negatable (Formula v p f)
- Data.Logic.Types.FirstOrderPublic: instance Typeable Formula
- Data.Logic.Types.FirstOrderPublic: unFormula :: Formula v p f -> Formula v p f
- Data.Logic.Types.Harrison.Equal: instance Apply FOLEQ PredName TermType
- Data.Logic.Types.Harrison.Equal: instance Arity PredName
- Data.Logic.Types.Harrison.Equal: instance Atom FOLEQ TermType String
- Data.Logic.Types.Harrison.Equal: instance AtomEq FOLEQ PredName TermType
- Data.Logic.Types.Harrison.Equal: instance Constants FOLEQ
- Data.Logic.Types.Harrison.Equal: instance Constants PredName
- Data.Logic.Types.Harrison.Equal: instance Data PredName
- Data.Logic.Types.Harrison.Equal: instance Eq FOLEQ
- Data.Logic.Types.Harrison.Equal: instance Eq PredName
- Data.Logic.Types.Harrison.Equal: instance Formula (Formula FOLEQ) FOLEQ => Literal (Formula FOLEQ) FOLEQ
- Data.Logic.Types.Harrison.Equal: instance Formula (Formula FOLEQ) FOLEQ => PropositionalFormula (Formula FOLEQ) FOLEQ
- Data.Logic.Types.Harrison.Equal: instance HasFixity (Formula FOLEQ)
- Data.Logic.Types.Harrison.Equal: instance HasFixity FOLEQ
- Data.Logic.Types.Harrison.Equal: instance IsString PredName
- Data.Logic.Types.Harrison.Equal: instance Ord FOLEQ
- Data.Logic.Types.Harrison.Equal: instance Ord PredName
- Data.Logic.Types.Harrison.Equal: instance Predicate PredName
- Data.Logic.Types.Harrison.Equal: instance Pretty FOLEQ
- Data.Logic.Types.Harrison.Equal: instance Pretty PredName
- Data.Logic.Types.Harrison.Equal: instance Show (Formula FOLEQ)
- Data.Logic.Types.Harrison.Equal: instance Show FOLEQ
- Data.Logic.Types.Harrison.Equal: instance Show PredName
- Data.Logic.Types.Harrison.Equal: instance Typeable PredName
- Data.Logic.Types.Harrison.FOL: instance Apply FOL String TermType
- Data.Logic.Types.Harrison.FOL: instance Arity String
- Data.Logic.Types.Harrison.FOL: instance Constants FOL
- Data.Logic.Types.Harrison.FOL: instance Constants String
- Data.Logic.Types.Harrison.FOL: instance Data Function
- Data.Logic.Types.Harrison.FOL: instance Eq FOL
- Data.Logic.Types.Harrison.FOL: instance Eq Function
- Data.Logic.Types.Harrison.FOL: instance Eq TermType
- Data.Logic.Types.Harrison.FOL: instance Function Function String
- Data.Logic.Types.Harrison.FOL: instance HasFixity FOL
- Data.Logic.Types.Harrison.FOL: instance Ord FOL
- Data.Logic.Types.Harrison.FOL: instance Ord Function
- Data.Logic.Types.Harrison.FOL: instance Ord TermType
- Data.Logic.Types.Harrison.FOL: instance Predicate String
- Data.Logic.Types.Harrison.FOL: instance Pretty FOL
- Data.Logic.Types.Harrison.FOL: instance Pretty Function
- Data.Logic.Types.Harrison.FOL: instance Pretty TermType
- Data.Logic.Types.Harrison.FOL: instance Show FOL
- Data.Logic.Types.Harrison.FOL: instance Show Function
- Data.Logic.Types.Harrison.FOL: instance Show TermType
- Data.Logic.Types.Harrison.FOL: instance Skolem Function String
- Data.Logic.Types.Harrison.FOL: instance Term TermType String Function
- Data.Logic.Types.Harrison.FOL: instance Typeable Function
- Data.Logic.Types.Harrison.Formulas.FirstOrder: instance (Constants a, Pretty a, HasFixity a) => Formula (Formula a) a
- Data.Logic.Types.Harrison.Formulas.FirstOrder: instance (Formula (Formula a) a, Constants a, Pretty a, HasFixity a) => FirstOrderFormula (Formula a) a String
- Data.Logic.Types.Harrison.Formulas.FirstOrder: instance Combinable (Formula a)
- Data.Logic.Types.Harrison.Formulas.FirstOrder: instance Constants (Formula a)
- Data.Logic.Types.Harrison.Formulas.FirstOrder: instance Eq a => Eq (Formula a)
- Data.Logic.Types.Harrison.Formulas.FirstOrder: instance FirstOrderFormula (Formula a) a String => Pretty (Formula a)
- Data.Logic.Types.Harrison.Formulas.FirstOrder: instance Negatable (Formula atom)
- Data.Logic.Types.Harrison.Formulas.FirstOrder: instance Ord a => Ord (Formula a)
- Data.Logic.Types.Harrison.Formulas.Propositional: instance (Combinable (Formula atom), Pretty atom, HasFixity atom, Ord atom) => PropositionalFormula (Formula atom) atom
- Data.Logic.Types.Harrison.Formulas.Propositional: instance (HasFixity atom, Pretty atom, Ord atom) => Literal (Formula atom) atom
- Data.Logic.Types.Harrison.Formulas.Propositional: instance (Pretty atom, HasFixity atom, Ord atom) => Formula (Formula atom) atom
- Data.Logic.Types.Harrison.Formulas.Propositional: instance (Pretty atom, HasFixity atom, Ord atom) => HasFixity (Formula atom)
- Data.Logic.Types.Harrison.Formulas.Propositional: instance (Pretty atom, HasFixity atom, Ord atom) => Pretty (Formula atom)
- Data.Logic.Types.Harrison.Formulas.Propositional: instance Combinable (Formula a)
- Data.Logic.Types.Harrison.Formulas.Propositional: instance Constants (Formula a)
- Data.Logic.Types.Harrison.Formulas.Propositional: instance Eq a => Eq (Formula a)
- Data.Logic.Types.Harrison.Formulas.Propositional: instance Negatable (Formula atom)
- Data.Logic.Types.Harrison.Formulas.Propositional: instance Ord a => Ord (Formula a)
- Data.Logic.Types.Harrison.Prop: instance Data Prop
- Data.Logic.Types.Harrison.Prop: instance Eq Prop
- Data.Logic.Types.Harrison.Prop: instance HasFixity Prop
- Data.Logic.Types.Harrison.Prop: instance HasFixity String
- Data.Logic.Types.Harrison.Prop: instance Ord Prop
- Data.Logic.Types.Harrison.Prop: instance Pretty Prop
- Data.Logic.Types.Harrison.Prop: instance Read Prop
- Data.Logic.Types.Harrison.Prop: instance Show (Formula Prop)
- Data.Logic.Types.Harrison.Prop: instance Show (Formula String)
- Data.Logic.Types.Harrison.Prop: instance Show Prop
- Data.Logic.Types.Harrison.Prop: instance Typeable Prop
- Data.Logic.Types.Harrison.Prop: pname :: Prop -> String
- Data.Logic.Types.Propositional: instance (Formula (Formula atom) atom, Pretty atom, HasFixity atom, Ord atom) => PropositionalFormula (Formula atom) atom
- Data.Logic.Types.Propositional: instance (Pretty atom, HasFixity atom, Ord atom) => Formula (Formula atom) atom
- Data.Logic.Types.Propositional: instance (Pretty atom, HasFixity atom, Ord atom) => HasFixity (Formula atom)
- Data.Logic.Types.Propositional: instance (Pretty atom, HasFixity atom, Ord atom) => Literal (Formula atom) atom
- Data.Logic.Types.Propositional: instance (Pretty atom, HasFixity atom, Ord atom) => Pretty (Formula atom)
- Data.Logic.Types.Propositional: instance Constants (Formula atom)
- Data.Logic.Types.Propositional: instance Data atom => Data (Formula atom)
- Data.Logic.Types.Propositional: instance Eq atom => Eq (Formula atom)
- Data.Logic.Types.Propositional: instance Negatable (Formula atom)
- Data.Logic.Types.Propositional: instance Ord atom => Combinable (Formula atom)
- Data.Logic.Types.Propositional: instance Ord atom => Ord (Formula atom)
- Data.Logic.Types.Propositional: instance Typeable Formula
+ Data.Boolean: instance GHC.Classes.Eq Data.Boolean.Literal
+ Data.Boolean: instance GHC.Show.Show Data.Boolean.Boolean
+ Data.Boolean: instance GHC.Show.Show Data.Boolean.Literal
+ Data.Boolean.SatSolver: instance GHC.Show.Show Data.Boolean.SatSolver.SatSolver
+ Data.Logic.Classes.Combine: instance Data.Data.Data Data.Logic.Classes.Combine.BinOp
+ Data.Logic.Classes.Combine: instance Data.Data.Data formula => Data.Data.Data (Data.Logic.Classes.Combine.Combination formula)
+ Data.Logic.Classes.Combine: instance Data.Logic.Classes.Pretty.Pretty Data.Logic.Classes.Combine.BinOp
+ Data.Logic.Classes.Combine: instance GHC.Classes.Eq Data.Logic.Classes.Combine.BinOp
+ Data.Logic.Classes.Combine: instance GHC.Classes.Eq formula => GHC.Classes.Eq (Data.Logic.Classes.Combine.Combination formula)
+ Data.Logic.Classes.Combine: instance GHC.Classes.Ord Data.Logic.Classes.Combine.BinOp
+ Data.Logic.Classes.Combine: instance GHC.Classes.Ord formula => GHC.Classes.Ord (Data.Logic.Classes.Combine.Combination formula)
+ Data.Logic.Classes.Combine: instance GHC.Enum.Bounded Data.Logic.Classes.Combine.BinOp
+ Data.Logic.Classes.Combine: instance GHC.Enum.Enum Data.Logic.Classes.Combine.BinOp
+ Data.Logic.Classes.Combine: instance GHC.Read.Read Data.Logic.Classes.Combine.BinOp
+ Data.Logic.Classes.Combine: instance GHC.Read.Read formula => GHC.Read.Read (Data.Logic.Classes.Combine.Combination formula)
+ Data.Logic.Classes.Combine: instance GHC.Show.Show Data.Logic.Classes.Combine.BinOp
+ Data.Logic.Classes.Combine: instance GHC.Show.Show formula => GHC.Show.Show (Data.Logic.Classes.Combine.Combination formula)
+ Data.Logic.Classes.Constants: instance Data.Logic.Classes.Pretty.Pretty GHC.Types.Bool
+ Data.Logic.Classes.Equals: instance (Data.Logic.Classes.Pretty.Pretty p, GHC.Classes.Ord p) => Data.Logic.Classes.Pretty.Pretty (Data.Logic.Classes.Equals.PredicateName p)
+ Data.Logic.Classes.Equals: instance GHC.Classes.Eq p => GHC.Classes.Eq (Data.Logic.Classes.Equals.PredicateName p)
+ Data.Logic.Classes.Equals: instance GHC.Classes.Ord p => GHC.Classes.Ord (Data.Logic.Classes.Equals.PredicateName p)
+ Data.Logic.Classes.Equals: instance GHC.Show.Show p => GHC.Show.Show (Data.Logic.Classes.Equals.PredicateName p)
+ Data.Logic.Classes.FirstOrder: instance Data.Data.Data Data.Logic.Classes.FirstOrder.Quant
+ Data.Logic.Classes.FirstOrder: instance Data.SafeCopy.SafeCopy.SafeCopy Data.Logic.Classes.FirstOrder.Quant
+ Data.Logic.Classes.FirstOrder: instance GHC.Classes.Eq Data.Logic.Classes.FirstOrder.Quant
+ Data.Logic.Classes.FirstOrder: instance GHC.Classes.Ord Data.Logic.Classes.FirstOrder.Quant
+ Data.Logic.Classes.FirstOrder: instance GHC.Enum.Bounded Data.Logic.Classes.FirstOrder.Quant
+ Data.Logic.Classes.FirstOrder: instance GHC.Enum.Enum Data.Logic.Classes.FirstOrder.Quant
+ Data.Logic.Classes.FirstOrder: instance GHC.Read.Read Data.Logic.Classes.FirstOrder.Quant
+ Data.Logic.Classes.FirstOrder: instance GHC.Show.Show Data.Logic.Classes.FirstOrder.Quant
+ Data.Logic.Classes.Pretty: instance Data.Logic.Classes.Pretty.Pretty GHC.Base.String
+ Data.Logic.Classes.Propositional: instance Data.SafeCopy.SafeCopy.SafeCopy Data.Logic.Classes.Combine.BinOp
+ Data.Logic.Classes.Propositional: instance Data.SafeCopy.SafeCopy.SafeCopy formula0 => Data.SafeCopy.SafeCopy.SafeCopy (Data.Logic.Classes.Combine.Combination formula0)
+ Data.Logic.Failing: instance Data.Data.Data a => Data.Data.Data (Control.Applicative.Error.Failing a)
+ Data.Logic.Failing: instance GHC.Base.Monad Control.Applicative.Error.Failing
+ Data.Logic.Failing: instance GHC.Classes.Eq a => GHC.Classes.Eq (Control.Applicative.Error.Failing a)
+ Data.Logic.Failing: instance GHC.Classes.Ord a => GHC.Classes.Ord (Control.Applicative.Error.Failing a)
+ Data.Logic.Failing: instance GHC.Read.Read a => GHC.Read.Read (Control.Applicative.Error.Failing a)
+ Data.Logic.Harrison.DP: instance Data.Logic.Harrison.DefCNF.NumAtom (Data.Logic.Harrison.PropExamples.Atom Data.Logic.Harrison.PropExamples.N)
+ Data.Logic.Harrison.DP: instance GHC.Classes.Eq Data.Logic.Harrison.DP.TrailMix
+ Data.Logic.Harrison.DP: instance GHC.Classes.Ord Data.Logic.Harrison.DP.TrailMix
+ Data.Logic.Harrison.DefCNF: instance Data.Logic.Harrison.DefCNF.NumAtom (Data.Logic.Harrison.DefCNF.Atom Data.Logic.Harrison.PropExamples.N)
+ Data.Logic.Harrison.PropExamples: instance Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Harrison.PropExamples.Atom Data.Logic.Harrison.PropExamples.N)
+ Data.Logic.Harrison.PropExamples: instance Data.Logic.Classes.Pretty.Pretty (Data.Logic.Harrison.PropExamples.Atom Data.Logic.Harrison.PropExamples.N)
+ Data.Logic.Harrison.PropExamples: instance GHC.Classes.Eq a => GHC.Classes.Eq (Data.Logic.Harrison.PropExamples.Atom a)
+ Data.Logic.Harrison.PropExamples: instance GHC.Classes.Ord a => GHC.Classes.Ord (Data.Logic.Harrison.PropExamples.Atom a)
+ Data.Logic.Harrison.PropExamples: instance GHC.Show.Show (Data.Logic.Types.Propositional.Formula (Data.Logic.Harrison.PropExamples.Atom GHC.Types.Int))
+ Data.Logic.Harrison.PropExamples: instance GHC.Show.Show a => GHC.Show.Show (Data.Logic.Harrison.PropExamples.Atom a)
+ Data.Logic.Instances.Chiou: instance (Data.Data.Data v, Data.Data.Data f) => Data.Data.Data (Data.Logic.Instances.Chiou.CTerm v f)
+ Data.Logic.Instances.Chiou: instance (Data.Data.Data v, Data.Data.Data f) => Data.Data.Data (Data.Logic.Instances.Chiou.NormalTerm v f)
+ Data.Logic.Instances.Chiou: instance (Data.Data.Data v, Data.Data.Data p, Data.Data.Data f) => Data.Data.Data (Data.Logic.Instances.Chiou.NormalSentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Data.Data v, Data.Data.Data p, Data.Data.Data f) => Data.Data.Data (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Formula.Formula (Data.Logic.Instances.Chiou.Sentence v p f) (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Combine.Combinable (Data.Logic.Instances.Chiou.NormalSentence v p f)) => Data.Logic.Classes.Formula.Formula (Data.Logic.Instances.Chiou.NormalSentence v p f) (Data.Logic.Instances.Chiou.NormalSentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Constants.Constants p, GHC.Classes.Eq (Data.Logic.Instances.Chiou.NormalSentence v p f)) => Data.Logic.Classes.Constants.Constants (Data.Logic.Instances.Chiou.NormalSentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Constants.Constants p, GHC.Classes.Eq (Data.Logic.Instances.Chiou.Sentence v p f)) => Data.Logic.Classes.Constants.Constants (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.FirstOrder.FirstOrderFormula (Data.Logic.Instances.Chiou.Sentence v p f) (Data.Logic.Instances.Chiou.Sentence v p f) v, Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Pretty.Pretty (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Instances.Chiou.NormalSentence v p f) (Data.Logic.Instances.Chiou.NormalSentence v p f), Data.Logic.Classes.Combine.Combinable (Data.Logic.Instances.Chiou.NormalSentence v p f), Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Variable.Variable v) => Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Instances.Chiou.NormalSentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Instances.Chiou.NormalSentence v p f) (Data.Logic.Instances.Chiou.NormalSentence v p f), Data.Logic.Classes.Combine.Combinable (Data.Logic.Instances.Chiou.NormalSentence v p f), Data.Logic.Classes.Term.Term (Data.Logic.Instances.Chiou.NormalTerm v f) v f, Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.FirstOrder.FirstOrderFormula (Data.Logic.Instances.Chiou.NormalSentence v p f) (Data.Logic.Instances.Chiou.NormalSentence v p f) v
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Instances.Chiou.NormalSentence v p f) (Data.Logic.Instances.Chiou.NormalSentence v p f), Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Combine.Combinable (Data.Logic.Instances.Chiou.NormalSentence v p f)) => Data.Logic.Classes.Pretty.Pretty (Data.Logic.Instances.Chiou.NormalSentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Instances.Chiou.Sentence v p f) (Data.Logic.Instances.Chiou.Sentence v p f), Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Variable.Variable v) => Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Instances.Chiou.Sentence v p f) (Data.Logic.Instances.Chiou.Sentence v p f), Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.FirstOrder.FirstOrderFormula (Data.Logic.Instances.Chiou.Sentence v p f) (Data.Logic.Instances.Chiou.Sentence v p f) v
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Instances.Chiou.Sentence v p f) (Data.Logic.Instances.Chiou.Sentence v p f), Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Combine.Combinable (Data.Logic.Instances.Chiou.Sentence v p f)) => Data.Logic.Classes.Propositional.PropositionalFormula (Data.Logic.Instances.Chiou.Sentence v p f) (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Apply.Apply (Data.Logic.Instances.Chiou.Sentence v p f) p (Data.Logic.Instances.Chiou.CTerm v f)
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Term.Term (Data.Logic.Instances.Chiou.CTerm v f) v f
+ Data.Logic.Instances.Chiou: instance (Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Term.Term (Data.Logic.Instances.Chiou.NormalTerm v f) v f
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Eq v, GHC.Classes.Eq f) => GHC.Classes.Eq (Data.Logic.Instances.Chiou.CTerm v f)
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Eq v, GHC.Classes.Eq f) => GHC.Classes.Eq (Data.Logic.Instances.Chiou.NormalTerm v f)
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Eq v, GHC.Classes.Eq p, GHC.Classes.Eq f) => GHC.Classes.Eq (Data.Logic.Instances.Chiou.ConjunctiveNormalForm v p f)
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Eq v, GHC.Classes.Eq p, GHC.Classes.Eq f) => GHC.Classes.Eq (Data.Logic.Instances.Chiou.NormalSentence v p f)
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Eq v, GHC.Classes.Eq p, GHC.Classes.Eq f) => GHC.Classes.Eq (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Ord v, GHC.Classes.Ord f) => GHC.Classes.Ord (Data.Logic.Instances.Chiou.CTerm v f)
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Ord v, GHC.Classes.Ord f) => GHC.Classes.Ord (Data.Logic.Instances.Chiou.NormalTerm v f)
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Ord v, GHC.Classes.Ord p, GHC.Classes.Ord f) => Data.Logic.Classes.Combine.Combinable (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Ord v, GHC.Classes.Ord p, GHC.Classes.Ord f) => GHC.Classes.Ord (Data.Logic.Instances.Chiou.NormalSentence v p f)
+ Data.Logic.Instances.Chiou: instance (GHC.Classes.Ord v, GHC.Classes.Ord p, GHC.Classes.Ord f) => GHC.Classes.Ord (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance Data.Data.Data Data.Logic.Instances.Chiou.Connective
+ Data.Logic.Instances.Chiou: instance Data.Data.Data Data.Logic.Instances.Chiou.Quantifier
+ Data.Logic.Instances.Chiou: instance Data.Logic.Classes.Apply.Predicate p => Data.Logic.Classes.Equals.AtomEq (Data.Logic.Instances.Chiou.Sentence v p f) p (Data.Logic.Instances.Chiou.CTerm v f)
+ Data.Logic.Instances.Chiou: instance Data.Logic.Classes.Negate.Negatable (Data.Logic.Instances.Chiou.NormalSentence v p f)
+ Data.Logic.Instances.Chiou: instance Data.Logic.Classes.Negate.Negatable (Data.Logic.Instances.Chiou.Sentence v p f)
+ Data.Logic.Instances.Chiou: instance Data.Logic.Classes.Variable.Variable v => Data.Logic.Classes.Skolem.Skolem (Data.Logic.Instances.Chiou.AtomicFunction v) v
+ Data.Logic.Instances.Chiou: instance Data.String.IsString (Data.Logic.Instances.Chiou.AtomicFunction v)
+ Data.Logic.Instances.Chiou: instance GHC.Classes.Eq Data.Logic.Instances.Chiou.Connective
+ Data.Logic.Instances.Chiou: instance GHC.Classes.Eq Data.Logic.Instances.Chiou.Quantifier
+ Data.Logic.Instances.Chiou: instance GHC.Classes.Eq v => GHC.Classes.Eq (Data.Logic.Instances.Chiou.AtomicFunction v)
+ Data.Logic.Instances.Chiou: instance GHC.Classes.Ord Data.Logic.Instances.Chiou.Connective
+ Data.Logic.Instances.Chiou: instance GHC.Classes.Ord Data.Logic.Instances.Chiou.Quantifier
+ Data.Logic.Instances.Chiou: instance GHC.Show.Show Data.Logic.Instances.Chiou.Connective
+ Data.Logic.Instances.Chiou: instance GHC.Show.Show Data.Logic.Instances.Chiou.Quantifier
+ Data.Logic.Instances.Chiou: instance GHC.Show.Show v => GHC.Show.Show (Data.Logic.Instances.Chiou.AtomicFunction v)
+ Data.Logic.Instances.PropLogic: instance (Data.Logic.Classes.Combine.Combinable (PropLogicCore.PropForm a), Data.Logic.Classes.Pretty.Pretty a, Data.Logic.Classes.Pretty.HasFixity a, GHC.Classes.Ord a) => Data.Logic.Classes.Propositional.PropositionalFormula (PropLogicCore.PropForm a) a
+ Data.Logic.Instances.PropLogic: instance (Data.Logic.Classes.Pretty.Pretty a, Data.Logic.Classes.Pretty.HasFixity a, GHC.Classes.Ord a) => Data.Logic.Classes.Formula.Formula (PropLogicCore.PropForm a) a
+ Data.Logic.Instances.PropLogic: instance (Data.Logic.Classes.Propositional.PropositionalFormula (PropLogicCore.PropForm atom) atom, Data.Logic.Classes.Pretty.HasFixity atom) => Data.Logic.Classes.Pretty.HasFixity (PropLogicCore.PropForm atom)
+ Data.Logic.Instances.PropLogic: instance (Data.Logic.Classes.Propositional.PropositionalFormula (PropLogicCore.PropForm atom) atom, Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom) => Data.Logic.Classes.Pretty.Pretty (PropLogicCore.PropForm atom)
+ Data.Logic.Instances.PropLogic: instance Data.Logic.Classes.Combine.Combinable (PropLogicCore.PropForm a)
+ Data.Logic.Instances.PropLogic: instance Data.Logic.Classes.Constants.Constants (PropLogicCore.PropForm formula)
+ Data.Logic.Instances.PropLogic: instance Data.Logic.Classes.Negate.Negatable (PropLogicCore.PropForm a)
+ Data.Logic.Instances.SatSolver: instance Data.Data.Data Data.Boolean.Literal
+ Data.Logic.Instances.SatSolver: instance Data.Logic.Classes.ClauseNormalForm.ClauseNormalFormula Data.Boolean.CNF Data.Boolean.Literal
+ Data.Logic.Instances.SatSolver: instance Data.Logic.Classes.Negate.Negatable Data.Boolean.Literal
+ Data.Logic.Instances.SatSolver: instance GHC.Classes.Ord Data.Boolean.Literal
+ Data.Logic.KnowledgeBase: [proofResult] :: Proof lit -> ProofResult
+ Data.Logic.KnowledgeBase: [proof] :: Proof lit -> Set (ImplicativeForm lit)
+ Data.Logic.KnowledgeBase: [wiIdent] :: WithId a -> Int
+ Data.Logic.KnowledgeBase: [wiItem] :: WithId a -> a
+ Data.Logic.KnowledgeBase: instance (Data.Data.Data lit, GHC.Classes.Ord lit) => Data.Data.Data (Data.Logic.KnowledgeBase.Proof lit)
+ Data.Logic.KnowledgeBase: instance (GHC.Classes.Ord lit, GHC.Show.Show lit, Data.Logic.Classes.Literal.Literal lit atom, Data.Logic.Classes.FirstOrder.FirstOrderFormula lit atom v) => GHC.Show.Show (Data.Logic.KnowledgeBase.Proof lit)
+ Data.Logic.KnowledgeBase: instance Data.Data.Data Data.Logic.KnowledgeBase.ProofResult
+ Data.Logic.KnowledgeBase: instance Data.Data.Data a => Data.Data.Data (Data.Logic.KnowledgeBase.WithId a)
+ Data.Logic.KnowledgeBase: instance Data.SafeCopy.SafeCopy.SafeCopy Data.Logic.KnowledgeBase.ProofResult
+ Data.Logic.KnowledgeBase: instance GHC.Classes.Eq Data.Logic.KnowledgeBase.ProofResult
+ Data.Logic.KnowledgeBase: instance GHC.Classes.Eq a => GHC.Classes.Eq (Data.Logic.KnowledgeBase.WithId a)
+ Data.Logic.KnowledgeBase: instance GHC.Classes.Eq lit => GHC.Classes.Eq (Data.Logic.KnowledgeBase.Proof lit)
+ Data.Logic.KnowledgeBase: instance GHC.Classes.Ord Data.Logic.KnowledgeBase.ProofResult
+ Data.Logic.KnowledgeBase: instance GHC.Classes.Ord a => GHC.Classes.Ord (Data.Logic.KnowledgeBase.WithId a)
+ Data.Logic.KnowledgeBase: instance GHC.Classes.Ord lit => GHC.Classes.Ord (Data.Logic.KnowledgeBase.Proof lit)
+ Data.Logic.KnowledgeBase: instance GHC.Show.Show Data.Logic.KnowledgeBase.ProofResult
+ Data.Logic.KnowledgeBase: instance GHC.Show.Show a => GHC.Show.Show (Data.Logic.KnowledgeBase.WithId a)
+ Data.Logic.Normal.Implicative: [neg] :: ImplicativeForm lit -> Set lit
+ Data.Logic.Normal.Implicative: [pos] :: ImplicativeForm lit -> Set lit
+ Data.Logic.Normal.Implicative: instance (Data.Data.Data lit, GHC.Classes.Ord lit) => Data.Data.Data (Data.Logic.Normal.Implicative.ImplicativeForm lit)
+ Data.Logic.Normal.Implicative: instance GHC.Classes.Eq lit => GHC.Classes.Eq (Data.Logic.Normal.Implicative.ImplicativeForm lit)
+ Data.Logic.Normal.Implicative: instance GHC.Classes.Ord lit => GHC.Classes.Ord (Data.Logic.Normal.Implicative.ImplicativeForm lit)
+ Data.Logic.Normal.Implicative: instance GHC.Show.Show lit => GHC.Show.Show (Data.Logic.Normal.Implicative.ImplicativeForm lit)
+ Data.Logic.Types.Common: instance Data.Logic.Classes.Variable.Variable GHC.Base.String
+ Data.Logic.Types.FirstOrder: instance (Data.Data.Data p, Data.Data.Data term) => Data.Data.Data (Data.Logic.Types.FirstOrder.Predicate p term)
+ Data.Logic.Types.FirstOrder: instance (Data.Data.Data p, Data.Data.Data term) => Data.Data.Data (Data.Logic.Types.FirstOrder.Predicate_v1 p term)
+ Data.Logic.Types.FirstOrder: instance (Data.Data.Data v, Data.Data.Data f) => Data.Data.Data (Data.Logic.Types.FirstOrder.PTerm v f)
+ Data.Logic.Types.FirstOrder: instance (Data.Data.Data v, Data.Data.Data p, Data.Data.Data f) => Data.Data.Data (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance (Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f))
+ Data.Logic.Types.FirstOrder: instance (Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Atom.Atom (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)) (Data.Logic.Types.FirstOrder.PTerm v f) v
+ Data.Logic.Types.FirstOrder: instance (Data.Logic.Classes.Constants.Constants p, GHC.Classes.Ord v, GHC.Classes.Ord p, GHC.Classes.Ord f, Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f))) => Data.Logic.Classes.Literal.Literal (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f))
+ Data.Logic.Types.FirstOrder: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f))) => Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Equals.AtomEq (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)) p (Data.Logic.Types.FirstOrder.PTerm v f), Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrder.Formula v p f), Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.FirstOrder.FirstOrderFormula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)) v
+ Data.Logic.Types.FirstOrder: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Pretty.Pretty (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrder.Formula v p f), Data.Logic.Classes.Combine.Combinable (Data.Logic.Types.FirstOrder.Formula v p f)) => Data.Logic.Classes.Propositional.PropositionalFormula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f))
+ Data.Logic.Types.FirstOrder: instance (Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Pretty.Pretty v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Pretty.Pretty p, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Pretty.Pretty f) => Data.Logic.Classes.Pretty.Pretty (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f))
+ Data.Logic.Types.FirstOrder: instance (Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Term.Term (Data.Logic.Types.FirstOrder.PTerm v f) v f
+ Data.Logic.Types.FirstOrder: instance (Data.SafeCopy.SafeCopy.SafeCopy p, Data.SafeCopy.SafeCopy.SafeCopy term) => Data.SafeCopy.SafeCopy.Migrate (Data.Logic.Types.FirstOrder.Predicate p term)
+ Data.Logic.Types.FirstOrder: instance (Data.SafeCopy.SafeCopy.SafeCopy p0, Data.SafeCopy.SafeCopy.SafeCopy term0) => Data.SafeCopy.SafeCopy.SafeCopy (Data.Logic.Types.FirstOrder.Predicate p0 term0)
+ Data.Logic.Types.FirstOrder: instance (Data.SafeCopy.SafeCopy.SafeCopy p0, Data.SafeCopy.SafeCopy.SafeCopy term0) => Data.SafeCopy.SafeCopy.SafeCopy (Data.Logic.Types.FirstOrder.Predicate_v1 p0 term0)
+ Data.Logic.Types.FirstOrder: instance (Data.SafeCopy.SafeCopy.SafeCopy v0, Data.SafeCopy.SafeCopy.SafeCopy f0) => Data.SafeCopy.SafeCopy.SafeCopy (Data.Logic.Types.FirstOrder.PTerm v0 f0)
+ Data.Logic.Types.FirstOrder: instance (Data.SafeCopy.SafeCopy.SafeCopy v0, Data.SafeCopy.SafeCopy.SafeCopy p0, Data.SafeCopy.SafeCopy.SafeCopy f0) => Data.SafeCopy.SafeCopy.SafeCopy (Data.Logic.Types.FirstOrder.Formula v0 p0 f0)
+ Data.Logic.Types.FirstOrder: instance (GHC.Classes.Eq p, GHC.Classes.Eq term) => GHC.Classes.Eq (Data.Logic.Types.FirstOrder.Predicate p term)
+ Data.Logic.Types.FirstOrder: instance (GHC.Classes.Eq p, GHC.Classes.Eq term) => GHC.Classes.Eq (Data.Logic.Types.FirstOrder.Predicate_v1 p term)
+ Data.Logic.Types.FirstOrder: instance (GHC.Classes.Eq v, GHC.Classes.Eq f) => GHC.Classes.Eq (Data.Logic.Types.FirstOrder.PTerm v f)
+ Data.Logic.Types.FirstOrder: instance (GHC.Classes.Eq v, GHC.Classes.Eq p, GHC.Classes.Eq f) => GHC.Classes.Eq (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance (GHC.Classes.Ord p, GHC.Classes.Ord term) => GHC.Classes.Ord (Data.Logic.Types.FirstOrder.Predicate p term)
+ Data.Logic.Types.FirstOrder: instance (GHC.Classes.Ord p, GHC.Classes.Ord term) => GHC.Classes.Ord (Data.Logic.Types.FirstOrder.Predicate_v1 p term)
+ Data.Logic.Types.FirstOrder: instance (GHC.Classes.Ord v, GHC.Classes.Ord f) => GHC.Classes.Ord (Data.Logic.Types.FirstOrder.PTerm v f)
+ Data.Logic.Types.FirstOrder: instance (GHC.Classes.Ord v, GHC.Classes.Ord p, GHC.Classes.Ord f) => GHC.Classes.Ord (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance (GHC.Read.Read p, GHC.Read.Read term) => GHC.Read.Read (Data.Logic.Types.FirstOrder.Predicate p term)
+ Data.Logic.Types.FirstOrder: instance (GHC.Read.Read p, GHC.Read.Read term) => GHC.Read.Read (Data.Logic.Types.FirstOrder.Predicate_v1 p term)
+ Data.Logic.Types.FirstOrder: instance (GHC.Read.Read v, GHC.Read.Read f) => GHC.Read.Read (Data.Logic.Types.FirstOrder.PTerm v f)
+ Data.Logic.Types.FirstOrder: instance (GHC.Read.Read v, GHC.Read.Read p, GHC.Read.Read f) => GHC.Read.Read (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance (GHC.Show.Show p, GHC.Show.Show term) => GHC.Show.Show (Data.Logic.Types.FirstOrder.Predicate p term)
+ Data.Logic.Types.FirstOrder: instance (GHC.Show.Show p, GHC.Show.Show term) => GHC.Show.Show (Data.Logic.Types.FirstOrder.Predicate_v1 p term)
+ Data.Logic.Types.FirstOrder: instance (GHC.Show.Show v, GHC.Show.Show f) => GHC.Show.Show (Data.Logic.Types.FirstOrder.PTerm v f)
+ Data.Logic.Types.FirstOrder: instance (GHC.Show.Show v, GHC.Show.Show p, GHC.Show.Show f) => GHC.Show.Show (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance Data.Logic.Classes.Apply.Predicate p => Data.Logic.Classes.Equals.AtomEq (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)) p (Data.Logic.Types.FirstOrder.PTerm v f)
+ Data.Logic.Types.FirstOrder: instance Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrder.Formula v p f) => Data.Logic.Classes.Combine.Combinable (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance Data.Logic.Classes.Constants.Constants p => Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance Data.Logic.Classes.Constants.Constants p => Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f))
+ Data.Logic.Types.FirstOrder: instance Data.Logic.Classes.Negate.Negatable (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.FirstOrder: instance Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Types.FirstOrder.Predicate p term)
+ Data.Logic.Types.FirstOrderPublic: [unFormula] :: Formula v p f -> Formula v p f
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Data.Data v, Data.Data.Data p, Data.Data.Data f) => Data.Data.Data (Data.Logic.Types.FirstOrderPublic.Formula v p f)
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f))
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Types.FirstOrderPublic.Formula v p f)
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrder.Formula v p f), Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrderPublic.Formula v p f)
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrderPublic.Formula v p f), Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrder.Formula v p f), Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Combine.Combinable (Data.Logic.Types.FirstOrderPublic.Formula v p f)
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Variable.Variable v) => GHC.Classes.Ord (Data.Logic.Types.FirstOrderPublic.Formula v p f)
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v, Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Constants.Constants (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.FirstOrder.FirstOrderFormula (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)) v) => GHC.Classes.Eq (Data.Logic.Types.FirstOrderPublic.Formula v p f)
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Pretty.Pretty v, GHC.Show.Show v, Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Pretty.Pretty p, GHC.Show.Show p, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Pretty.Pretty f, GHC.Show.Show f, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Pretty.Pretty (Data.Logic.Types.FirstOrderPublic.Formula v p f)
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.FirstOrder.FirstOrderFormula (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)) v
+ Data.Logic.Types.FirstOrderPublic: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), Data.Logic.Classes.Formula.Formula (Data.Logic.Types.FirstOrder.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f)), GHC.Show.Show v, GHC.Show.Show p, GHC.Show.Show f, Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Types.FirstOrderPublic.Formula v p f), Data.Logic.Classes.Variable.Variable v, Data.Logic.Classes.Apply.Predicate p, Data.Logic.Classes.Term.Function f v) => Data.Logic.Classes.Propositional.PropositionalFormula (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Predicate p (Data.Logic.Types.FirstOrder.PTerm v f))
+ Data.Logic.Types.FirstOrderPublic: instance (Data.SafeCopy.SafeCopy.SafeCopy v0, Data.SafeCopy.SafeCopy.SafeCopy p0, Data.SafeCopy.SafeCopy.SafeCopy f0) => Data.SafeCopy.SafeCopy.SafeCopy (Data.Logic.Types.FirstOrderPublic.Formula v0 p0 f0)
+ Data.Logic.Types.FirstOrderPublic: instance (GHC.Show.Show v, GHC.Show.Show p, GHC.Show.Show f) => GHC.Show.Show (Data.Logic.Types.FirstOrderPublic.Formula v p f)
+ Data.Logic.Types.FirstOrderPublic: instance Data.Logic.Classes.Negate.Negatable (Data.Logic.Types.FirstOrderPublic.Formula v p f)
+ Data.Logic.Types.FirstOrderPublic: instance Data.Logic.Types.FirstOrderPublic.Bijection (Data.Logic.Classes.Combine.Combination (Data.Logic.Types.FirstOrderPublic.Formula v p f)) (Data.Logic.Classes.Combine.Combination (Data.Logic.Types.FirstOrder.Formula v p f))
+ Data.Logic.Types.FirstOrderPublic: instance Data.Logic.Types.FirstOrderPublic.Bijection (Data.Logic.Types.FirstOrderPublic.Formula v p f) (Data.Logic.Types.FirstOrder.Formula v p f)
+ Data.Logic.Types.Harrison.Equal: instance Data.Data.Data Data.Logic.Types.Harrison.Equal.PredName
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Apply.Apply Data.Logic.Types.Harrison.Equal.FOLEQ Data.Logic.Types.Harrison.Equal.PredName Data.Logic.Types.Harrison.FOL.TermType
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Apply.Predicate Data.Logic.Types.Harrison.Equal.PredName
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Arity.Arity Data.Logic.Types.Harrison.Equal.PredName
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Atom.Atom Data.Logic.Types.Harrison.Equal.FOLEQ Data.Logic.Types.Harrison.FOL.TermType GHC.Base.String
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Constants.Constants Data.Logic.Types.Harrison.Equal.FOLEQ
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Constants.Constants Data.Logic.Types.Harrison.Equal.PredName
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Equals.AtomEq Data.Logic.Types.Harrison.Equal.FOLEQ Data.Logic.Types.Harrison.Equal.PredName Data.Logic.Types.Harrison.FOL.TermType
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Formula.Formula (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula Data.Logic.Types.Harrison.Equal.FOLEQ) Data.Logic.Types.Harrison.Equal.FOLEQ => Data.Logic.Classes.Literal.Literal (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula Data.Logic.Types.Harrison.Equal.FOLEQ) Data.Logic.Types.Harrison.Equal.FOLEQ
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Formula.Formula (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula Data.Logic.Types.Harrison.Equal.FOLEQ) Data.Logic.Types.Harrison.Equal.FOLEQ => Data.Logic.Classes.Propositional.PropositionalFormula (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula Data.Logic.Types.Harrison.Equal.FOLEQ) Data.Logic.Types.Harrison.Equal.FOLEQ
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula Data.Logic.Types.Harrison.Equal.FOLEQ)
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Pretty.HasFixity Data.Logic.Types.Harrison.Equal.FOLEQ
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Pretty.Pretty Data.Logic.Types.Harrison.Equal.FOLEQ
+ Data.Logic.Types.Harrison.Equal: instance Data.Logic.Classes.Pretty.Pretty Data.Logic.Types.Harrison.Equal.PredName
+ Data.Logic.Types.Harrison.Equal: instance Data.String.IsString Data.Logic.Types.Harrison.Equal.PredName
+ Data.Logic.Types.Harrison.Equal: instance GHC.Classes.Eq Data.Logic.Types.Harrison.Equal.FOLEQ
+ Data.Logic.Types.Harrison.Equal: instance GHC.Classes.Eq Data.Logic.Types.Harrison.Equal.PredName
+ Data.Logic.Types.Harrison.Equal: instance GHC.Classes.Ord Data.Logic.Types.Harrison.Equal.FOLEQ
+ Data.Logic.Types.Harrison.Equal: instance GHC.Classes.Ord Data.Logic.Types.Harrison.Equal.PredName
+ Data.Logic.Types.Harrison.Equal: instance GHC.Show.Show (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula Data.Logic.Types.Harrison.Equal.FOLEQ)
+ Data.Logic.Types.Harrison.Equal: instance GHC.Show.Show Data.Logic.Types.Harrison.Equal.FOLEQ
+ Data.Logic.Types.Harrison.Equal: instance GHC.Show.Show Data.Logic.Types.Harrison.Equal.PredName
+ Data.Logic.Types.Harrison.FOL: instance Data.Data.Data Data.Logic.Types.Harrison.FOL.Function
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Apply.Apply Data.Logic.Types.Harrison.FOL.FOL GHC.Base.String Data.Logic.Types.Harrison.FOL.TermType
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Apply.Predicate GHC.Base.String
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Arity.Arity GHC.Base.String
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Constants.Constants Data.Logic.Types.Harrison.FOL.FOL
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Constants.Constants GHC.Base.String
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Pretty.HasFixity Data.Logic.Types.Harrison.FOL.FOL
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Pretty.Pretty Data.Logic.Types.Harrison.FOL.FOL
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Pretty.Pretty Data.Logic.Types.Harrison.FOL.Function
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Pretty.Pretty Data.Logic.Types.Harrison.FOL.TermType
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Skolem.Skolem Data.Logic.Types.Harrison.FOL.Function GHC.Base.String
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Term.Function Data.Logic.Types.Harrison.FOL.Function GHC.Base.String
+ Data.Logic.Types.Harrison.FOL: instance Data.Logic.Classes.Term.Term Data.Logic.Types.Harrison.FOL.TermType GHC.Base.String Data.Logic.Types.Harrison.FOL.Function
+ Data.Logic.Types.Harrison.FOL: instance GHC.Classes.Eq Data.Logic.Types.Harrison.FOL.FOL
+ Data.Logic.Types.Harrison.FOL: instance GHC.Classes.Eq Data.Logic.Types.Harrison.FOL.Function
+ Data.Logic.Types.Harrison.FOL: instance GHC.Classes.Eq Data.Logic.Types.Harrison.FOL.TermType
+ Data.Logic.Types.Harrison.FOL: instance GHC.Classes.Ord Data.Logic.Types.Harrison.FOL.FOL
+ Data.Logic.Types.Harrison.FOL: instance GHC.Classes.Ord Data.Logic.Types.Harrison.FOL.Function
+ Data.Logic.Types.Harrison.FOL: instance GHC.Classes.Ord Data.Logic.Types.Harrison.FOL.TermType
+ Data.Logic.Types.Harrison.FOL: instance GHC.Show.Show Data.Logic.Types.Harrison.FOL.FOL
+ Data.Logic.Types.Harrison.FOL: instance GHC.Show.Show Data.Logic.Types.Harrison.FOL.Function
+ Data.Logic.Types.Harrison.FOL: instance GHC.Show.Show Data.Logic.Types.Harrison.FOL.TermType
+ Data.Logic.Types.Harrison.Formulas.FirstOrder: instance (Data.Logic.Classes.Constants.Constants a, Data.Logic.Classes.Pretty.Pretty a, Data.Logic.Classes.Pretty.HasFixity a) => Data.Logic.Classes.Formula.Formula (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula a) a
+ Data.Logic.Types.Harrison.Formulas.FirstOrder: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula a) a, Data.Logic.Classes.Constants.Constants a, Data.Logic.Classes.Pretty.Pretty a, Data.Logic.Classes.Pretty.HasFixity a) => Data.Logic.Classes.FirstOrder.FirstOrderFormula (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula a) a GHC.Base.String
+ Data.Logic.Types.Harrison.Formulas.FirstOrder: instance Data.Logic.Classes.Combine.Combinable (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula a)
+ Data.Logic.Types.Harrison.Formulas.FirstOrder: instance Data.Logic.Classes.Constants.Constants (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula a)
+ Data.Logic.Types.Harrison.Formulas.FirstOrder: instance Data.Logic.Classes.FirstOrder.FirstOrderFormula (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula a) a GHC.Base.String => Data.Logic.Classes.Pretty.Pretty (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula a)
+ Data.Logic.Types.Harrison.Formulas.FirstOrder: instance Data.Logic.Classes.Negate.Negatable (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula atom)
+ Data.Logic.Types.Harrison.Formulas.FirstOrder: instance GHC.Classes.Eq a => GHC.Classes.Eq (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula a)
+ Data.Logic.Types.Harrison.Formulas.FirstOrder: instance GHC.Classes.Ord a => GHC.Classes.Ord (Data.Logic.Types.Harrison.Formulas.FirstOrder.Formula a)
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance (Data.Logic.Classes.Combine.Combinable (Data.Logic.Types.Harrison.Formulas.Propositional.Formula atom), Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Propositional.PropositionalFormula (Data.Logic.Types.Harrison.Formulas.Propositional.Formula atom) atom
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance (Data.Logic.Classes.Pretty.HasFixity atom, Data.Logic.Classes.Pretty.Pretty atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Literal.Literal (Data.Logic.Types.Harrison.Formulas.Propositional.Formula atom) atom
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance (Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Formula.Formula (Data.Logic.Types.Harrison.Formulas.Propositional.Formula atom) atom
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance (Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Types.Harrison.Formulas.Propositional.Formula atom)
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance (Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Pretty.Pretty (Data.Logic.Types.Harrison.Formulas.Propositional.Formula atom)
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance Data.Logic.Classes.Combine.Combinable (Data.Logic.Types.Harrison.Formulas.Propositional.Formula a)
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance Data.Logic.Classes.Constants.Constants (Data.Logic.Types.Harrison.Formulas.Propositional.Formula a)
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance Data.Logic.Classes.Negate.Negatable (Data.Logic.Types.Harrison.Formulas.Propositional.Formula atom)
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance GHC.Classes.Eq a => GHC.Classes.Eq (Data.Logic.Types.Harrison.Formulas.Propositional.Formula a)
+ Data.Logic.Types.Harrison.Formulas.Propositional: instance GHC.Classes.Ord a => GHC.Classes.Ord (Data.Logic.Types.Harrison.Formulas.Propositional.Formula a)
+ Data.Logic.Types.Harrison.Prop: [pname] :: Prop -> String
+ Data.Logic.Types.Harrison.Prop: instance Data.Data.Data Data.Logic.Types.Harrison.Prop.Prop
+ Data.Logic.Types.Harrison.Prop: instance Data.Logic.Classes.Pretty.HasFixity Data.Logic.Types.Harrison.Prop.Prop
+ Data.Logic.Types.Harrison.Prop: instance Data.Logic.Classes.Pretty.HasFixity GHC.Base.String
+ Data.Logic.Types.Harrison.Prop: instance Data.Logic.Classes.Pretty.Pretty Data.Logic.Types.Harrison.Prop.Prop
+ Data.Logic.Types.Harrison.Prop: instance GHC.Classes.Eq Data.Logic.Types.Harrison.Prop.Prop
+ Data.Logic.Types.Harrison.Prop: instance GHC.Classes.Ord Data.Logic.Types.Harrison.Prop.Prop
+ Data.Logic.Types.Harrison.Prop: instance GHC.Read.Read Data.Logic.Types.Harrison.Prop.Prop
+ Data.Logic.Types.Harrison.Prop: instance GHC.Show.Show (Data.Logic.Types.Harrison.Formulas.Propositional.Formula Data.Logic.Types.Harrison.Prop.Prop)
+ Data.Logic.Types.Harrison.Prop: instance GHC.Show.Show (Data.Logic.Types.Harrison.Formulas.Propositional.Formula GHC.Base.String)
+ Data.Logic.Types.Harrison.Prop: instance GHC.Show.Show Data.Logic.Types.Harrison.Prop.Prop
+ Data.Logic.Types.Propositional: instance (Data.Logic.Classes.Formula.Formula (Data.Logic.Types.Propositional.Formula atom) atom, Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Propositional.PropositionalFormula (Data.Logic.Types.Propositional.Formula atom) atom
+ Data.Logic.Types.Propositional: instance (Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Formula.Formula (Data.Logic.Types.Propositional.Formula atom) atom
+ Data.Logic.Types.Propositional: instance (Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Literal.Literal (Data.Logic.Types.Propositional.Formula atom) atom
+ Data.Logic.Types.Propositional: instance (Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Pretty.HasFixity (Data.Logic.Types.Propositional.Formula atom)
+ Data.Logic.Types.Propositional: instance (Data.Logic.Classes.Pretty.Pretty atom, Data.Logic.Classes.Pretty.HasFixity atom, GHC.Classes.Ord atom) => Data.Logic.Classes.Pretty.Pretty (Data.Logic.Types.Propositional.Formula atom)
+ Data.Logic.Types.Propositional: instance Data.Data.Data atom => Data.Data.Data (Data.Logic.Types.Propositional.Formula atom)
+ Data.Logic.Types.Propositional: instance Data.Logic.Classes.Constants.Constants (Data.Logic.Types.Propositional.Formula atom)
+ Data.Logic.Types.Propositional: instance Data.Logic.Classes.Negate.Negatable (Data.Logic.Types.Propositional.Formula atom)
+ Data.Logic.Types.Propositional: instance GHC.Classes.Eq atom => GHC.Classes.Eq (Data.Logic.Types.Propositional.Formula atom)
+ Data.Logic.Types.Propositional: instance GHC.Classes.Ord atom => Data.Logic.Classes.Combine.Combinable (Data.Logic.Types.Propositional.Formula atom)
+ Data.Logic.Types.Propositional: instance GHC.Classes.Ord atom => GHC.Classes.Ord (Data.Logic.Types.Propositional.Formula atom)
- Data.Logic.Classes.Combine: class Negatable formula => Combinable formula where x .&. y = (.~.) ((.~.) x .|. (.~.) y) x .<=>. y = (x .=>. y) .&. (y .=>. x) x .=>. y = ((.~.) x .|. y) x .<=. y = y .=>. x x .<~>. y = ((.~.) x .&. y) .|. (x .&. (.~.) y) x .~|. y = (.~.) (x .|. y) x .~&. y = (.~.) (x .&. y)
+ Data.Logic.Classes.Combine: class (Negatable formula) => Combinable formula where x .&. y = (.~.) ((.~.) x .|. (.~.) y) x .<=>. y = (x .=>. y) .&. (y .=>. x) x .=>. y = ((.~.) x .|. y) x .<=. y = y .=>. x x .<~>. y = ((.~.) x .&. y) .|. (x .&. (.~.) y) x .~|. y = (.~.) (x .|. y) x .~&. y = (.~.) (x .&. y)
- Data.Logic.Classes.FirstOrder: onatoms :: FirstOrderFormula formula atom v => (atom -> formula) -> formula -> formula
+ Data.Logic.Classes.FirstOrder: onatoms :: (FirstOrderFormula formula atom v) => (atom -> formula) -> formula -> formula
- Data.Logic.Classes.FirstOrder: prettyFirstOrder :: FirstOrderFormula formula atom v => (Int -> atom -> Doc) -> (v -> Doc) -> Int -> formula -> Doc
+ Data.Logic.Classes.FirstOrder: prettyFirstOrder :: (FirstOrderFormula formula atom v) => (Int -> atom -> Doc) -> (v -> Doc) -> Int -> formula -> Doc
- Data.Logic.Classes.Literal: prettyLit :: Literal lit atom => (Int -> atom -> Doc) -> (v -> Doc) -> Int -> lit -> Doc
+ Data.Logic.Classes.Literal: prettyLit :: (Literal lit atom) => (Int -> atom -> Doc) -> (v -> Doc) -> Int -> lit -> Doc
- Data.Logic.Classes.Propositional: clauseNormalForm :: PropositionalFormula formula atom => formula -> formula
+ Data.Logic.Classes.Propositional: clauseNormalForm :: (PropositionalFormula formula atom) => formula -> formula
- Data.Logic.Classes.Propositional: clauseNormalForm' :: PropositionalFormula formula atom => formula -> Set (Set formula)
+ Data.Logic.Classes.Propositional: clauseNormalForm' :: (PropositionalFormula formula atom) => formula -> Set (Set formula)
- Data.Logic.Classes.Propositional: clauseNormalFormAlt :: PropositionalFormula formula atom => formula -> formula
+ Data.Logic.Classes.Propositional: clauseNormalFormAlt :: (PropositionalFormula formula atom) => formula -> formula
- Data.Logic.Classes.Propositional: clauseNormalFormAlt' :: PropositionalFormula formula atom => formula -> Set (Set formula)
+ Data.Logic.Classes.Propositional: clauseNormalFormAlt' :: (PropositionalFormula formula atom) => formula -> Set (Set formula)
- Data.Logic.Classes.Propositional: disjunctiveNormalForm :: PropositionalFormula formula atom => formula -> formula
+ Data.Logic.Classes.Propositional: disjunctiveNormalForm :: (PropositionalFormula formula atom) => formula -> formula
- Data.Logic.Classes.Propositional: negationNormalForm :: PropositionalFormula formula atom => formula -> formula
+ Data.Logic.Classes.Propositional: negationNormalForm :: (PropositionalFormula formula atom) => formula -> formula
- Data.Logic.Classes.Propositional: showPropositional :: PropositionalFormula formula atom => (atom -> String) -> formula -> String
+ Data.Logic.Classes.Propositional: showPropositional :: (PropositionalFormula formula atom) => (atom -> String) -> formula -> String
- Data.Logic.Classes.Term: prettyTerm :: Term term v f => (v -> Doc) -> (f -> Doc) -> term -> Doc
+ Data.Logic.Classes.Term: prettyTerm :: (Term term v f) => (v -> Doc) -> (f -> Doc) -> term -> Doc
- Data.Logic.HUnit: assertEqual :: (Eq a, Show a) => String -> a -> a -> Assertion
+ Data.Logic.HUnit: assertEqual :: (?loc :: CallStack, Eq a, Show a) => String -> a -> a -> Assertion
- Data.Logic.Harrison.Formulas.Propositional: over_atoms :: PropositionalFormula formula atomic => (atomic -> b -> b) -> formula -> b -> b
+ Data.Logic.Harrison.Formulas.Propositional: over_atoms :: (PropositionalFormula formula atomic) => (atomic -> b -> b) -> formula -> b -> b
- Data.Logic.Harrison.Herbrand: groundterms :: Term term v f => Set term -> Set (f, Int) -> Int -> Set term
+ Data.Logic.Harrison.Herbrand: groundterms :: (Term term v f) => Set term -> Set (f, Int) -> Int -> Set term
- Data.Logic.Harrison.Herbrand: groundtuples :: Term term v f => Set term -> Set (f, Int) -> Int -> Int -> Set [term]
+ Data.Logic.Harrison.Herbrand: groundtuples :: (Term term v f) => Set term -> Set (f, Int) -> Int -> Int -> Set [term]
- Data.Logic.Harrison.Lib: allpairs :: Ord c => (a -> b -> c) -> Set a -> Set b -> Set c
+ Data.Logic.Harrison.Lib: allpairs :: (Ord c) => (a -> b -> c) -> Set a -> Set b -> Set c
- Data.Logic.Harrison.Prop: dual :: PropositionalFormula formula atomic => formula -> formula
+ Data.Logic.Harrison.Prop: dual :: (PropositionalFormula formula atomic) => formula -> formula
- Data.Logic.Harrison.Prop: onAllValuations :: Ord a => (r -> r -> r) -> (Map a Bool -> r) -> Map a Bool -> Set a -> r
+ Data.Logic.Harrison.Prop: onAllValuations :: (Ord a) => (r -> r -> r) -> (Map a Bool -> r) -> Map a Bool -> Set a -> r
Files
- Data/Logic/HUnit.hs +0/−3
- changelog +6/−0
- logic-classes.cabal +1/−1
Data/Logic/HUnit.hs view
@@ -62,6 +62,3 @@ type TestEq' = forall formula atom term v p f. TestFormulaEq formula atom term v p f => Test formula type FormulaEq' = forall formula atom term v p f. TestFormulaEq formula atom term v p f => formula -}--instance IsString Function where- fromString = FName
changelog view
@@ -1,3 +1,9 @@+haskell-logic-classes (1.5.3) unstable; urgency=low++ * Restore tests.++ -- David Fox <dsf@seereason.com> Sat, 17 Oct 2015 07:07:30 -0700+ haskell-logic-classes (1.5) unstable; urgency=low * Move the pApp* functions from Data.Logic.Classes.FirstOrder to
logic-classes.cabal view
@@ -1,5 +1,5 @@ Name: logic-classes-Version: 1.5.2+Version: 1.5.3 Synopsis: Framework for propositional and first order logic, theorem proving Description: Package to support Propositional and First Order Logic. It includes classes representing the different types of formulas and terms, some instances of