| Copyright | (c) Dominik Luecke, Uni Bremen 2007 |
|---|---|
| License | GPLv2 or higher, see LICENSE.txt |
| Maintainer | luecke@informatik.uni-bremen.de |
| Stability | experimental |
| Portability | portable Definition of signatures for propositional logic Ref. Till Mossakowski, Joseph Goguen, Razvan Diaconescu, Andrzej Tarlecki. What is a Logic?. In Jean-Yves Beziau (Ed.), Logica Universalis, pp. 113-@133. Birkhaeuser. 2005. |
| Safe Haskell | Safe-Inferred |
Temporal.Sign
Description
Documentation
newtype Sign
Datatype for propositional Signatures Signatures are just sets
Instances
| Eq Sign | |
| Ord Sign | |
| Show Sign | |
| ShATermConvertible Sign | |
| Pretty Sign | |
| Typeable * Sign | |
| Category Sign Morphism | Instance of Category for temporal logic |
| Sentences Temporal FORMULA Sign Morphism Symbol | Instance of Sentences for temporal logic |
| StaticAnalysis Temporal BASIC_SPEC FORMULA () () Sign Morphism Symbol Symbol | Static Analysis for propositional logic |
| Logic Temporal () BASIC_SPEC FORMULA () () Sign Morphism Symbol Symbol () | Instance of Logic for propositional logc |
isLegalSignature :: Sign -> Bool
determines whether a signature is vaild all sets are ok, so glued to true
isSubSigOf :: Sign -> Sign -> Bool
Determines if sig1 is subsignature of sig2