jukebox-0.1.2: A first-order reasoning toolbox

Safe HaskellNone

Jukebox.TPTP.ClauseParser

Documentation

data ParseState Source

Constructors

MkState ![Input Form] !(Map ByteString Type) !(Map ByteString (Name ::: FunType)) !(Map ByteString (Name ::: Type)) Type !(Closed ()) 

data IncludeStatement Source

Constructors

Include ByteString (Maybe [Tag]) 

Instances

testParser :: Parser a -> String -> Either [String] aSource

punct' :: Stream a Token => (Punct -> Bool) -> Parsec a TokenSource

binExpr :: Parser a -> Parser (a -> a -> Parser a) -> Parser aSource

section :: (Tag -> Bool) -> Parser (Maybe IncludeStatement)Source

input :: (Tag -> Bool) -> Parser ()Source

newNameFrom :: Named a => Closed () -> a -> (Closed (), Name)Source

findType :: ByteString -> Parser TypeSource

applyFunction :: ByteString -> [Term] -> Type -> Parser TermSource

data Thing Source

Constructors

Apply !ByteString ![Term] 
Term !Term 
Formula !Form 

class TermLike a whereSource

Methods

fromThing :: Thing -> Parser aSource

var :: [ctx :: Maybe (Map ByteString Variable)] => Parser aSource

parser :: ([binder :: Parser Variable], [ctx :: Maybe (Map ByteString Variable)]) => Parser aSource

term :: ([binder :: Parser Variable], [ctx :: Maybe (Map ByteString Variable)], TermLike a) => Parser aSource

literal :: ([binder :: Parser Variable], [ctx :: Maybe (Map ByteString Variable)], FormulaLike a) => Parser aSource

formula :: ([binder :: Parser Variable], [ctx :: Maybe (Map ByteString Variable)], FormulaLike a) => Parser aSource

quantified :: ([binder :: Parser Variable], [ctx :: Maybe (Map ByteString Variable)], FormulaLike a) => Parser aSource

unitary :: ([binder :: Parser Variable], [ctx :: Maybe (Map ByteString Variable)], FormulaLike a) => Parser aSource

data Type_ Source

Constructors

TType 
Fun [Type] Type 
Prod [Type]