Resolving dependencies... Configuring fgl-5.5.0.1... Building fgl-5.5.0.1... Preprocessing library fgl-5.5.0.1... [ 1 of 29] Compiling Paths_fgl ( dist/build/autogen/Paths_fgl.hs, dist/build/Paths_fgl.o ) [ 2 of 29] Compiling Data.Graph.Inductive.Internal.Thread ( Data/Graph/Inductive/Internal/Thread.hs, dist/build/Data/Graph/Inductive/Internal/Thread.o ) [ 3 of 29] Compiling Data.Graph.Inductive.Graph ( Data/Graph/Inductive/Graph.hs, dist/build/Data/Graph/Inductive/Graph.o ) [ 4 of 29] Compiling Data.Graph.Inductive.Basic ( Data/Graph/Inductive/Basic.hs, dist/build/Data/Graph/Inductive/Basic.o ) [ 5 of 29] Compiling Data.Graph.Inductive.PatriciaTree ( Data/Graph/Inductive/PatriciaTree.hs, dist/build/Data/Graph/Inductive/PatriciaTree.o ) [ 6 of 29] Compiling Data.Graph.Inductive.Monad ( Data/Graph/Inductive/Monad.hs, dist/build/Data/Graph/Inductive/Monad.o ) [ 7 of 29] Compiling Data.Graph.Inductive.Monad.IOArray ( Data/Graph/Inductive/Monad/IOArray.hs, dist/build/Data/Graph/Inductive/Monad/IOArray.o ) [ 8 of 29] Compiling Data.Graph.Inductive.Example ( Data/Graph/Inductive/Example.hs, dist/build/Data/Graph/Inductive/Example.o ) [ 9 of 29] Compiling Data.Graph.Inductive.Query.DFS ( Data/Graph/Inductive/Query/DFS.hs, dist/build/Data/Graph/Inductive/Query/DFS.o ) [10 of 29] Compiling Data.Graph.Inductive.Query.Indep ( Data/Graph/Inductive/Query/Indep.hs, dist/build/Data/Graph/Inductive/Query/Indep.o ) [11 of 29] Compiling Data.Graph.Inductive.Query.ArtPoint ( Data/Graph/Inductive/Query/ArtPoint.hs, dist/build/Data/Graph/Inductive/Query/ArtPoint.o ) [12 of 29] Compiling Data.Graph.Inductive.Query.BCC ( Data/Graph/Inductive/Query/BCC.hs, dist/build/Data/Graph/Inductive/Query/BCC.o ) [13 of 29] Compiling Data.Graph.Inductive.Query.Dominators ( Data/Graph/Inductive/Query/Dominators.hs, dist/build/Data/Graph/Inductive/Query/Dominators.o ) [14 of 29] Compiling Data.Graph.Inductive.Query.TransClos ( Data/Graph/Inductive/Query/TransClos.hs, dist/build/Data/Graph/Inductive/Query/TransClos.o ) [15 of 29] Compiling Data.Graph.Inductive.Query.Monad ( Data/Graph/Inductive/Query/Monad.hs, dist/build/Data/Graph/Inductive/Query/Monad.o ) [16 of 29] Compiling Data.Graph.Inductive.Internal.RootPath ( Data/Graph/Inductive/Internal/RootPath.hs, dist/build/Data/Graph/Inductive/Internal/RootPath.o ) [17 of 29] Compiling Data.Graph.Inductive.Internal.Queue ( Data/Graph/Inductive/Internal/Queue.hs, dist/build/Data/Graph/Inductive/Internal/Queue.o ) [18 of 29] Compiling Data.Graph.Inductive.Query.BFS ( Data/Graph/Inductive/Query/BFS.hs, dist/build/Data/Graph/Inductive/Query/BFS.o ) [19 of 29] Compiling Data.Graph.Inductive.Query.MaxFlow ( Data/Graph/Inductive/Query/MaxFlow.hs, dist/build/Data/Graph/Inductive/Query/MaxFlow.o ) [20 of 29] Compiling Data.Graph.Inductive.Internal.Heap ( Data/Graph/Inductive/Internal/Heap.hs, dist/build/Data/Graph/Inductive/Internal/Heap.o ) [21 of 29] Compiling Data.Graph.Inductive.Query.SP ( Data/Graph/Inductive/Query/SP.hs, dist/build/Data/Graph/Inductive/Query/SP.o ) [22 of 29] Compiling Data.Graph.Inductive.Query.GVD ( Data/Graph/Inductive/Query/GVD.hs, dist/build/Data/Graph/Inductive/Query/GVD.o ) [23 of 29] Compiling Data.Graph.Inductive.Query.MST ( Data/Graph/Inductive/Query/MST.hs, dist/build/Data/Graph/Inductive/Query/MST.o ) [24 of 29] Compiling Data.Graph.Inductive.Internal.FiniteMap ( Data/Graph/Inductive/Internal/FiniteMap.hs, dist/build/Data/Graph/Inductive/Internal/FiniteMap.o ) [25 of 29] Compiling Data.Graph.Inductive.NodeMap ( Data/Graph/Inductive/NodeMap.hs, dist/build/Data/Graph/Inductive/NodeMap.o ) [26 of 29] Compiling Data.Graph.Inductive.Query.MaxFlow2 ( Data/Graph/Inductive/Query/MaxFlow2.hs, dist/build/Data/Graph/Inductive/Query/MaxFlow2.o ) [27 of 29] Compiling Data.Graph.Inductive.Query ( Data/Graph/Inductive/Query.hs, dist/build/Data/Graph/Inductive/Query.o ) [28 of 29] Compiling Data.Graph.Inductive ( Data/Graph/Inductive.hs, dist/build/Data/Graph/Inductive.o ) [29 of 29] Compiling Data.Graph.Inductive.Tree ( Data/Graph/Inductive/Tree.hs, dist/build/Data/Graph/Inductive/Tree.o ) In-place registering fgl-5.5.0.1... Running Haddock for fgl-5.5.0.1... Running hscolour for fgl-5.5.0.1... Preprocessing library fgl-5.5.0.1... Preprocessing library fgl-5.5.0.1... Haddock coverage: 0% ( 0 / 8) in 'Paths_fgl' 23% ( 3 / 13) in 'Data.Graph.Inductive.Internal.Thread' 96% ( 75 / 78) in 'Data.Graph.Inductive.Graph' 100% ( 18 / 18) in 'Data.Graph.Inductive.Basic' 33% ( 1 / 3) in 'Data.Graph.Inductive.PatriciaTree' 47% ( 8 / 17) in 'Data.Graph.Inductive.Monad' 40% ( 4 / 10) in 'Data.Graph.Inductive.Monad.IOArray' 23% ( 14 / 61) in 'Data.Graph.Inductive.Example' 16% ( 5 / 32) in 'Data.Graph.Inductive.Query.DFS' 50% ( 1 / 2) in 'Data.Graph.Inductive.Query.Indep' 50% ( 1 / 2) in 'Data.Graph.Inductive.Query.ArtPoint' 50% ( 1 / 2) in 'Data.Graph.Inductive.Query.BCC' 67% ( 2 / 3) in 'Data.Graph.Inductive.Query.Dominators' 50% ( 1 / 2) in 'Data.Graph.Inductive.Query.TransClos' 30% ( 13 / 43) in 'Data.Graph.Inductive.Query.Monad' 33% ( 3 / 9) in 'Data.Graph.Inductive.Internal.RootPath' 22% ( 2 / 9) in 'Data.Graph.Inductive.Internal.Queue' 33% ( 6 / 18) in 'Data.Graph.Inductive.Query.BFS' 100% ( 9 / 9) in 'Data.Graph.Inductive.Query.MaxFlow' 19% ( 3 / 16) in 'Data.Graph.Inductive.Internal.Heap' 20% ( 1 / 5) in 'Data.Graph.Inductive.Query.SP' 12% ( 1 / 8) in 'Data.Graph.Inductive.Query.GVD' 40% ( 2 / 5) in 'Data.Graph.Inductive.Query.MST' 38% ( 8 / 21) in 'Data.Graph.Inductive.Internal.FiniteMap' 48% ( 21 / 44) in 'Data.Graph.Inductive.NodeMap' 20% ( 1 / 5) in 'Data.Graph.Inductive.Query.MaxFlow2' 93% ( 13 / 14) in 'Data.Graph.Inductive.Query' 90% ( 9 / 10) in 'Data.Graph.Inductive' 33% ( 1 / 3) in 'Data.Graph.Inductive.Tree' Documentation created: dist/doc/html/fgl/index.html, dist/doc/html/fgl/fgl.txt Installing library in /srv/hackage/var/build/tmp-install/lib/x86_64-linux-ghc-7.6.3/fgl-5.5.0.1 Registering fgl-5.5.0.1... Installed fgl-5.5.0.1 Downloading CarneadesDSL-1.3... Configuring CarneadesDSL-1.3... Building CarneadesDSL-1.3... Preprocessing library CarneadesDSL-1.3... [1 of 4] Compiling Language.Carneades.Cyclic ( Language/Carneades/Cyclic.hs, dist/build/Language/Carneades/Cyclic.o ) [2 of 4] Compiling Language.Carneades.CarneadesDSL ( Language/Carneades/CarneadesDSL.lhs, dist/build/Language/Carneades/CarneadesDSL.o ) [3 of 4] Compiling Language.Carneades.Input ( Language/Carneades/Input.hs, dist/build/Language/Carneades/Input.o ) [4 of 4] Compiling Language.Carneades.ExampleCAES ( Language/Carneades/ExampleCAES.lhs, dist/build/Language/Carneades/ExampleCAES.o ) In-place registering CarneadesDSL-1.3... Running Haddock for CarneadesDSL-1.3... Running hscolour for CarneadesDSL-1.3... Preprocessing library CarneadesDSL-1.3... Preprocessing library CarneadesDSL-1.3... Haddock coverage: 0% ( 0 / 2) in 'Language.Carneades.Cyclic' 5% ( 3 / 57) in 'Language.Carneades.CarneadesDSL' 100% ( 4 / 4) in 'Language.Carneades.Input' doc comment parse failed: should not be acceptable, because the weight of $\mathit{arg2} < \alpha$. However, note that we can't reach the opposite conclusion either: \begin{spec} acceptable (mkProp "murder") caes > False acceptable (mkProp "-murder") caes > False \end{spec} As a further extension, one could for example imagine giving an argumentation theorist the means to see a trace of the derivation of acceptability. It would be straightforward to add further primitives to the DSL and keeping track of intermediate results for acceptability and applicability to achieve this. 24% ( 4 / 17) in 'Language.Carneades.ExampleCAES' Documentation created: dist/doc/html/CarneadesDSL/index.html, dist/doc/html/CarneadesDSL/CarneadesDSL.txt Installing library in /srv/hackage/var/build/tmp-install/lib/x86_64-linux-ghc-7.6.3/CarneadesDSL-1.3 Registering CarneadesDSL-1.3... Installed CarneadesDSL-1.3