This library defines a representation of a search space as a tree and various search strategies on this tree. This module implements strong encapsulation as discussed in this paper
Warning: In contrast to the SearchTree Module, free variables that are not bound in the encapsulated expression remain free! This may lead to nondeterminism if such an escaped variable is bound later via pattern matching.
Author: Michael Hanus, Bjoern Peemoeller, Fabian Reck
Version: July 2013
isVar
:: a > Bool
Tests whether the argument is a free variable This function is only meaningful when applied to a part of a result of an encapsulated expression if the argument stems from a Value
node of
a SearchTree

identicalVars
:: a > a > Bool
Tests whether both arguments are identical free variables. 
varId
:: a > Int
Returns the unique identifier of a free variable, if the argument was not a free variable, otherwise an error is raised. 
getSearchTree
:: a > IO (SearchTree a)
Returns the search tree for some expression. 
someSearchTree
:: a > SearchTree a
Internal operation to return the search tree for some expression. 
isDefined
:: a > Bool
Returns True iff the argument is is defined, i.e., has a value. 
showSearchTree
:: SearchTree a > String
Shows the search tree as an intended line structure 
searchTreeSize
:: SearchTree a > (Int,Int,Int)
Return the size (number of Value/Fail/Or nodes) of the search tree 
allValuesDFS
:: SearchTree a > [a]
Return all values in a search tree via depthfirst search 
dfsStrategy
:: SearchTree a > ValueSequence a

allValuesBFS
:: SearchTree a > [a]
Return all values in a search tree via breadthfirst search 
bfsStrategy
:: SearchTree a > ValueSequence a

allValuesIDS
:: SearchTree a > [a]
Return all values in a search tree via iterativedeepening search. 
idsStrategy
:: SearchTree a > ValueSequence a

allValuesIDSwith
:: Int > (Int > Int) > SearchTree a > [a]
Return the list of all values in a search tree via iterativedeepening search. 
idsStrategyWith
:: Int > (Int > Int) > SearchTree a > ValueSequence a
Return all values in a search tree via iterativedeepening search. 
getAllValuesWith
:: (SearchTree a > ValueSequence a) > a > IO [a]
Gets all values of an expression w.r.t. 
someValue
:: a > a
Returns some value for an expression. 
someValueWith
:: (SearchTree a > ValueSequence a) > a > a
Returns some value for an expression w.r.t. 
A search tree is a value, a failure, or a choice between two search trees.
Constructors:
Value
:: a > SearchTree a
Fail
:: Int > SearchTree a
Or
:: (SearchTree a) > (SearchTree a) > SearchTree a
Type synonym: Strategy a = SearchTree a > ValueSequence a
Tests whether the argument is a free variable
This function is only meaningful when applied to
a part of a result of an encapsulated expression
if the argument stems from a 
Tests whether both arguments are identical free variables.
This function is only meaningful when applied to
parts of a result of an encapsulated expression
if the argument stems from a 
Returns the unique identifier of a free variable,
if the argument was not a free variable, otherwise an error is raised.
This function is only meaningful when applied to
a part of a result of an encapsulated expression
if the argument stems from a 
Returns the search tree for some expression. 
Internal operation to return the search tree for some expression. Note that this operation is not purely declarative since the ordering in the resulting search tree depends on the ordering of the program rules.

Returns True iff the argument is is defined, i.e., has a value. 
Shows the search tree as an intended line structure 
Return the size (number of Value/Fail/Or nodes) of the search tree 
Return all values in a search tree via depthfirst search 

Return all values in a search tree via breadthfirst search 

Return all values in a search tree via iterativedeepening search. 

Return the list of all values in a search tree via iterativedeepening search. The first argument is the initial depth bound and the second argument is a function to increase the depth in each iteration. 
Return all values in a search tree via iterativedeepening search. The first argument is the initial depth bound and the second argument is a function to increase the depth in each iteration. 
Gets all values of an expression w.r.t. a search strategy.
A search strategy is an operation to traverse a search tree
and collect all values, e.g., 
Returns some value for an expression. Note that this operation is not purely declarative since the computed value depends on the ordering of the program rules. Thus, this operation should be used only if the expression has a single value. It fails if the expression has no value. 
Returns some value for an expression w.r.t. a search strategy.
A search strategy is an operation to traverse a search tree
and collect all values, e.g., Note that this operation is not purely declarative since the computed value depends on the ordering of the program rules. Thus, this operation should be used only if the expression has a single value. It fails if the expression has no value. 