1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 |
------------------------------------------------------------------------------ --- Library for dynamic predicates. --- <a href="http://www.informatik.uni-kiel.de/~mh/papers/JFLP04_dyn.html"> --- This paper</a> contains a description of the basic ideas --- behind this library. --- --- Currently, it is still experimental so that its interface might --- be slightly changed in the future. --- --- A dynamic predicate <code>p</code> with arguments of type --- <code>t1,...,tn</code> must be declared by: --- --- <code>p :: t1 -> ... -> tn -> Dynamic</code><br/> --- <code>p = dynamic</code> --- --- --- A dynamic predicate where all facts should be persistently stored --- in the directory <code>DIR</code> must be declared by: --- --- <code>p :: t1 -> ... -> tn -> Dynamic</code><br/> --- <code>p = persistent "file:DIR"</code> --- --- Remark: --- This library has been revised to the library <code>Database</code>. --- Thus, it might not be further supported in the future. --- --- @author Michael Hanus --- @version August 2011 --- @category database ------------------------------------------------------------------------------ module Dynamic(Dynamic,(<>),(|>),(|&>),dynamic,persistent, assert,retract,getKnowledge, getDynamicSolutions,getDynamicSolution,isKnown, transaction,transactionWithErrorCatch,abortTransaction) where import AllSolutions infixr 2 <> infixl 1 |>, |&> ---------------------------------------------------------------------- --- The general type of dynamic predicates. data Dynamic = Dynamic DynSpec -- a single predicate | Prod Dynamic Dynamic -- cartesian product of two dynamics | Cond Dynamic Bool -- conditional dynamic -- The behavior specification of a dynamic predicate (only internally used). data DynSpec = Temporary -- a dynamic predicate that exists only during -- a single execution of a program | Persistent -- a persistent dynamic predicate --- <code>dynamic</code> is only used for the declaration of --- a dynamic predicate and should not be used elsewhere. dynamic :: _ dynamic = failed --- <code>persistent</code> is only used for the declaration of --- a persistent dynamic predicate and should not be used elsewhere. persistent :: String -> _ persistent _ = failed ---------------------------------------------------------------------- --- Combine two dynamics. (<>) :: Dynamic -> Dynamic -> Dynamic d1 <> d2 = Prod d1 d2 --- Restrict a dynamic with a condition. (|>) :: Dynamic -> Bool -> Dynamic d |> b = Cond d b --- Restrict a dynamic with a constraint. (|&>) :: Dynamic -> Bool -> Dynamic d |&> c = d |> (c &> True) --- Asserts new facts (without free variables!) about dynamic predicates. --- Conditional dynamics are asserted only if the condition holds. assert :: Dynamic -> IO () assert (Dynamic spec) = assertFact (Dynamic spec) assert (Prod d1 d2) = assert d1 >> assert d2 assert (Cond d b) = if b then assert d else done --- Deletes facts (without free variables!) about dynamic predicates. --- Conditional dynamics are retracted only if the condition holds. --- Returns True if all facts to be retracted exist, --- otherwise False is returned. retract :: Dynamic -> IO Bool retract (Dynamic spec) = retractFact (Dynamic spec) retract (Prod d1 d2) = do b1 <- retract d1 b2 <- retract d2 return (b1&&b2) retract (Cond d b) = if b then retract d else return True --- Returns the knowledge at a particular point of time about dynamic --- predicates. If other processes made changes to persistent predicates, --- these changes are read and made visible to the currently running program. getKnowledge :: IO (Dynamic -> Bool) getKnowledge = do known <- getDynamicKnowledge return (knownAll known) where knownAll k (Dynamic spec) = k (Dynamic spec) knownAll k (Prod d1 d2) = knownAll k d1 & knownAll k d2 knownAll k (Cond d b) = knownAll k d & b=:=True --- Returns all answers to an abstraction on a dynamic expression. --- If other processes made changes to persistent predicates, --- these changes are read and made visible to the currently running program. getDynamicSolutions :: (a -> Dynamic) -> IO [a] getDynamicSolutions query = do known <- getKnowledge getAllSolutions (\x -> known (query x)) --- Returns an answer to an abstraction on a dynamic expression. --- Returns Nothing if no answer exists. --- If other processes made changes to persistent predicates, --- these changes are read and made visible to the currently running program. getDynamicSolution :: (a -> Dynamic) -> IO (Maybe a) getDynamicSolution query = do known <- getKnowledge getOneSolution (\x -> known (query x)) --- Returns True if there exists the argument facts (without free variables!) --- and False, otherwise. isKnown :: Dynamic -> IO Bool isKnown (Dynamic spec) = do known <- getDynamicKnowledge first <- getOneSolution (\_ -> known (Dynamic spec)) return (first /= Nothing) isKnown (Prod d1 d2) = do b1 <- isKnown d1 b2 <- isKnown d2 return (b1&&b2) isKnown (Cond d c) = do b <- isKnown d return (b&&c) --- Perform an action (usually containing updates of various --- dynamic predicates) as a single transaction. --- This is the preferred way to execute any changes to persistent --- dynamic predicates if there might be more than one process --- that may modify the definition of such predicates in parallel. --- --- Before the transaction is executed, the access to all persistent --- predicates is locked (i.e., no other process can perform a --- transaction in parallel). --- After the successful transaction, the access is unlocked so that --- the updates performed in this transaction become persistent and --- visible to other processes. --- Otherwise (i.e., in case of a failure or abort of the transaction), --- the changes of the transaction to persistent predicates are --- ignored and Nothing is returned. --- --- In general, a transaction should terminate and all failures inside --- a transaction should be handled (execept for abortTransaction). --- If a transaction is externally interrupted (e.g., by killing the process), --- some locks might never be removed. However, they --- can be explicitly removed by deleting the corresponding lock files --- reported at startup time. --- --- Nested transactions are not supported and lead to a failure. transaction :: IO a -> IO (Maybe a) transaction action = do tnr <- startTransaction catch (performTrans tnr) (\e -> catch abortTransaction -- we perform an explicit abort in -- case of run time errors in action (\_ -> putStrLn (showError e) >> return Nothing)) where performTrans tnr = do result <- action commitTransaction tnr return (Just result) --- Perform an action (usually containing updates of various --- dynamic predicates) as a single transaction. --- This is similar to <code>transaction</code> but an execution --- error is caught and returned instead of printing it. transactionWithErrorCatch :: IO a -> IO (Either a IOError) transactionWithErrorCatch action = do tnr <- startTransaction catch (performTrans tnr) (\e -> catch abortTransaction -- we perform an explicit abort in -- case of run time errors in action (\_ -> return (Right e))) where performTrans tnr = do result <- action commitTransaction tnr return (Left result) --- Aborts the current transaction. If a transaction is aborted, --- the remaining actions of the transaction are not executed --- and all changes to <b>persistent</b> dynamic predicates --- made in this transaction are ignored. --- --- abortTransaction should only be used in a transaction. --- Although the execution of abortTransaction always fails --- (basically, it writes an abort record in log files, unlock them --- and then fails), the failure is handled inside <code>transaction</code>. abortTransaction :: IO _ abortTransaction external ------------------------------------------------------------------------ -- Internals... -- Asserts a new fact (without free variables!) about a dynamic predicate. assertFact :: Dynamic -> IO () assertFact pred = prim_assertFact $## pred prim_assertFact :: Dynamic -> IO () prim_assertFact external -- Deletes a fact (without free variables!) about a dynamic predicate. -- Returns True if there was such a fact and False, otherwise. retractFact :: Dynamic -> IO Bool retractFact pred = prim_retractFact $## pred prim_retractFact :: Dynamic -> IO Bool prim_retractFact external -- Returns the knowledge at a particular point of time about all dynamic -- predicates. If other processes made changes to persistent predicates, -- these changes are read and made visible to the currently running program. getDynamicKnowledge :: IO (Dynamic -> Bool) getDynamicKnowledge external -- To implement transactions: lock persistent files, load newest version, -- and mark begin of transaction in log files startTransaction :: IO Int startTransaction external -- To implement transactions: mark end of transaction in log files and -- unlock persistent files commitTransaction :: Int -> IO () commitTransaction t = prim_commitTransaction $# t prim_commitTransaction :: Int -> IO () prim_commitTransaction external -- ...to implement getKnowledge: isKnownAtTime :: Int -> Dynamic -> Bool isKnownAtTime t dyn = (prim_isKnownAtTime $# t) $!! dyn prim_isKnownAtTime :: Int -> Dynamic -> Bool prim_isKnownAtTime external |