Copyright | (c) Dominik Luecke, Uni Bremen 2007 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | luecke@informatik.uni-bremen.de |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe-Inferred |
Definition of abstract syntax for propositional logic
- data FORMULA
- data BASIC_ITEMS
- newtype BASIC_SPEC = Basic_spec [Annoted BASIC_ITEMS]
- data SYMB_ITEMS = Symb_items [SYMB] Range
- newtype SYMB = Symb_id Token
- data SYMB_MAP_ITEMS = Symb_map_items [SYMB_OR_MAP] Range
- data SYMB_OR_MAP
- data PRED_ITEM = Pred_item [Token] Range
- isPrimForm :: FORMULA -> Bool
Documentation
data FORMULA
Datatype for propositional formulas
False_atom Range | |
True_atom Range | |
Predication Token | |
Negation FORMULA Range | |
Conjunction [FORMULA] Range | |
Disjunction [FORMULA] Range | |
Implication FORMULA FORMULA Range | |
Equivalence FORMULA FORMULA Range |
data BASIC_ITEMS
newtype BASIC_SPEC
data SYMB_ITEMS
newtype SYMB
data SYMB_MAP_ITEMS
data SYMB_OR_MAP
data PRED_ITEM
predicates = propotions
isPrimForm :: FORMULA -> Bool