tableaux 0.1 → 0.2

raw patch · 7 files changed

+10/−11 lines, 7 filesdep −haskell98dep ~parsec

Dependencies removed: haskell98

Dependency ranges changed: parsec

Files

• src/Examples.hs +1/−1
• src/FOL.hs +1/−1
• src/Markup.hs +1/−1
• src/Parser.hs +2/−2
• src/Tableaux.hs +1/−1
• src/Util.hs +1/−1
• tableaux.cabal +3/−4

@@ -1,5 +1,5 @@ -module Examples where+module Examples(examples) where import FOL import Text.Html 

@@ -4,7 +4,7 @@    pbv@dcc.fc.up.pt  -} module FOL where-import List+import Data.List import Data.Map (Map) import qualified Data.Map as Map import Data.Tree

@@ -13,7 +13,7 @@ import Parser import Util import CSS-import List(intersperse,span)+import Data.List(intersperse,span)   data Form = Form {

@@ -12,8 +12,8 @@ import qualified Text.ParserCombinators.Parsec.Token as P import Text.ParserCombinators.Parsec.Language import Control.Monad-import Char-import List (intersperse)+import Data.Char+import Data.List (intersperse) import Test.QuickCheck  -- setup a tokenizer

@@ -9,7 +9,7 @@ import FOL import Unify  import qualified Data.Map as Map-import Maybe +import Data.Maybe   {-     Data.Tree from Haskell's standard library

@@ -1,6 +1,6 @@  module Util where-import Char+import Data.Char import Test.QuickCheck  

@@ -1,5 +1,5 @@ name:    tableaux-version: 0.1+version: 0.2  category: Theorem Provers @@ -8,7 +8,7 @@ description:   This is a simple web-based interactive theorem prover    using semantic tableaux for propositional and first-order logic  -  (cf. "First-Order Logic", Raymond Smullyan, Dover).+  (cf. First-Order Logic, Raymond Smullyan, Dover).   It allows step-by-step construction of proofs and runs on any   web server supporting the CGI interface.   @@ -31,11 +31,10 @@   other-modules:    FOL Unify Tableaux Markup CSS Parser Zipper Examples Util    build-depends:     base       >= 4       && < 5,-    haskell98,     containers,     mtl >= 1.1,     html >= 1.0,-    parsec >= 2.1  && <3,+    parsec >= 2.1,     cgi >= 3001.1,     QuickCheck >= 2.1