Copyright | (c) 2017 2018 N Steenbergen |
---|---|
License | GPL-3 |
Maintainer | ns@slak.ws |
Stability | experimental |
Safe Haskell | Safe |
Language | Haskell2010 |
Re-export of the Formula
datastructure, including class instances.
- module Logic.Judge.Formula.Datastructure
- module Logic.Judge.Formula.Parser
- class (Eq e, Ord e, Parseable e, Subterm e e, HasVariables e, Substitutable e e) => Extension e
Documentation
module Logic.Judge.Formula.Parser
class (Eq e, Ord e, Parseable e, Subterm e e, HasVariables e, Substitutable e e) => Extension e Source #
Any extension of logical formulas is parseable, its extension terms are subterms of its formulas, and they can be substituted into.
This encompassing class shortens class constraints and also avoids UndecidableInstances in some cases.