| Copyright | (c) Harm Brouwer and Noortje Venhuizen |
|---|---|
| License | Apache-2.0 |
| Maintainer | me@hbrouwer.eu, n.j.venhuizen@rug.nl |
| Stability | provisional |
| Portability | portable |
| Safe Haskell | Safe-Inferred |
| Language | Haskell98 |
Data.FOL.Formula
Contents
Description
FOL formula data structure
Exported
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 |