Copyright | (c) DFKI GmbH Uni Bremen 2002-2008 Tom Kranz 2021-2022 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | Christian.Maeder@dfki.de |
Stability | provisional |
Portability | non-portable (via DeriveDataTypeable, FlexibleInstances) |
Safe Haskell | None |
Datatype for storing of the proof tree. Actual proof tree (dag) structures can be printed as dot (Graphviz) digraphs.
Documentation
ProofTree String | |
ProofGraph (Gr ProofGraphNode Int) |
Instances
type ProofGraphNode = Either String (String, String) Source #
Orphan instances
ShATermConvertible (Gr ProofGraphNode Int) Source # | |
toShATermAux :: ATermTable -> Gr ProofGraphNode Int -> IO (ATermTable, Int) toShATermList' :: ATermTable -> [Gr ProofGraphNode Int] -> IO (ATermTable, Int) fromShATermAux :: Int -> ATermTable -> (ATermTable, Gr ProofGraphNode Int) fromShATermList' :: Int -> ATermTable -> (ATermTable, [Gr ProofGraphNode Int]) |