Module Control.Search.AllValues
Library with operations to encapsulate search, i.e., non-deterministic computations, as I/O operations in order to make the results dependend on the external world, e.g., the schedule for non-determinism.
To encapsulate search in non-I/O computations, one can use
set functions (see module Control.Search.SetFunctions.
Exported Functions
getAllValues
:: a -> IO [a] 
Gets all values of an expression (similarly to Prolog's findall).
Conceptually, the value is computed on a copy of the expression,
i.e., the evaluation of the expression does not share any results.
In PAKCS, the evaluation suspends as long as the expression
contains unbound variables or the computed
value contains unbound variables.
- Further infos:
-
- might behave indeterministically
getOneValue
:: a -> IO (Maybe a)
Gets one value of an expression. Returns Nothing
if the search space
is finitely failed.
Conceptually, the value is computed on a copy of the expression,
i.e., the evaluation of the expression does not share any results.
In PAKCS, the evaluation suspends as long as the expression
contains unbound variables or the computed
value contains unbound variables.
- Further infos:
-
- might behave indeterministically
getAllFailures
:: a -> (a -> Bool) -> IO [a]
Returns a list of values that do not satisfy a given constraint.
:: a
|
an expression (a generator evaluable to various values) |
-> a -> Bool
|
a constraint that should not be satisfied |
-> IO [a]
|
A list of all values of e such that (c e) is not provable |
- Further infos:
-
- might behave indeterministically