pdrt-sandbox-0.1.1: (Projective) Discourse Representation Theory
Copyright(c) Harm Brouwer and Noortje Venhuizen
LicenseApache-2.0
Maintainerme@hbrouwer.eu, n.j.venhuizen@rug.nl
Stabilityprovisional
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell98

Data.FOL.Formula

Contents

Description

FOL formula data structure

Synopsis

Exported

data FOLForm #

First Order Logic formula

Constructors

Exists FOLVar FOLForm

An existential quantification

ForAll FOLVar FOLForm

A universal quantification

And FOLForm FOLForm

A conjunction

Or FOLForm FOLForm

A disjunction

Imp FOLForm FOLForm

An implication

Neg FOLForm

A negation

Rel FOLPred [FOLVar]

A relation

Top

True constant

Bottom

False constant

Instances

Instances details
Show FOLForm #

Derive an instance of the Show typeclass for FOLForm.

Instance details

Defined in Data.FOL.Show

Eq FOLForm # 
Instance details

Defined in Data.FOL.Formula

Methods

(==) :: FOLForm -> FOLForm -> Bool #

(/=) :: FOLForm -> FOLForm -> Bool #

type FOLVar = String #

First Order Logic variable

type FOLPred = String #

First Order Logic predicate