Folly-0.2.0.0: A first order logic library in Haskell

Index

appendVarNameFolly.Formula
applyToTermsFolly.Formula
applyUnifierFolly.Unification
bicFolly.Formula
ClauseFolly.Clause
collectVarsFolly.Formula
conFolly.Formula
conclusionFolly.Theorem
constantFolly.Formula
deleteTautologiesFolly.Clause
disFolly.Formula
emptyFolly.Clause
ErrorFolly.Utils
extractValueFolly.Utils
fFolly.Formula
faFolly.Formula
FailedFolly.Utils
FormulaFolly.Formula
freeVarsFolly.Formula
funcFolly.Formula
funcArgsFolly.Formula
funcNameFolly.Formula
fvtFolly.Formula
generalizeFolly.Formula
givenClauseFolly.Clause
hypothesisFolly.Theorem
impFolly.Formula
isAtomFolly.Formula
isConstFolly.Formula
isFuncFolly.Formula
isPredFolly.Lexer
isValidFolly.Resolution
isValid'Folly.Resolution
isVar 
1 (Function)Folly.Lexer
2 (Function)Folly.Formula
lexerFolly.Lexer
literalArgsFolly.Formula
matchingLiteralsFolly.Formula
maxClauseFolly.Resolution
mostGeneralUnifierFolly.Unification
NameFolly.Utils
nameFolly.Lexer
negFolly.Formula
parseFormulaFolly.Parser
parseTheoremFolly.Parser
posFolly.Lexer
prFolly.Formula
resolvedClausesFolly.Clause
showTraceFolly.Clause
skfFolly.Formula
standardSkolemFolly.Resolution
stripNegationsFolly.Formula
subFormulaFolly.Formula
subTermFolly.Formula
SucceededFolly.Utils
tFolly.Formula
teFolly.Formula
TermFolly.Formula
testOpFolly.Lexer
testPredFolly.Lexer
testQuantFolly.Lexer
testSepFolly.Lexer
testVarFolly.Lexer
TheoremFolly.Theorem
theoremFolly.Theorem
toClausalFormFolly.Formula
TokenFolly.Lexer
toPNFFolly.Formula
toSkolemFormFolly.Formula
UnifierFolly.Unification
unifierFolly.Unification
uniqueVarSubFolly.Unification
varFolly.Formula
varNameFolly.Formula
varsFolly.Formula