cflp-2009.2.1: Constraint Functional-Logic Programming in HaskellContentsIndex
Search:
!
.&&.
.||.
:!
===
?
after
apply
applyBinCons
applyChoice
ApplyCons
applyCons
applyNotFunction
assertBoolean
assertResults
assertResultsLimit
assertResultsN
assertVariable
bfs
bfs_B
Boolean
BooleanSolver
booleanToBool
callTimeChoice
1 (Function)
2 (Function)
caseOf
caseOf_
CFLP
Computation
cons
ConsPatList
constr
constructors
Context
1 (Type/Class)
2 (Data Constructor)
countDepth
CTC
Ctx
currentDepth
Data
dCons
Decons
Depth
DepthCounter
DepthCtx
DepthLim
DepthLimCtx
depthLimit
DepthLimiter
dfs
dfs_B
diag
diag_B
dNil
Enumerable
enumeration
eval
evalPartial
evalPrint
failure
fair
fair_B
false
flip
foldr
fun
functionConversion
Generic
generic
genericOps
getRandomGen
groundNormalForm
head
ID
id
ifThen
ifThenElse
ignoreFirstNarrowSecond
ignot
incrementDepth
initID
iterDFS
iterDFS_B
limDFS
limDFS_B
limitDepth
lookupBoolean
map
mapSharedUnknowns
Match
memberWithFold
Monadic
monadic
Narrow
narrow
neg
negHeads
nil
no
noDemandOnSharedVar
Nondet
nondet
NormalForm
not
null
oneOf
overApplication
partialNormalForm
patterns
pCons
pFalse
pNil
pointfreeReverse
primitive
pTrue
randomise
Randomiser
resetDepthLimit
Result
reverseWithFoldr
Rnd
RndCtx
rndDFS
rndDFS_B
Sat
SatCtx
satSolving
setDepthLimit
setRandomGen
sharedCompoundTerms
sharedVarsAreEqual
StoreCTC
tail
tests
1 (Function)
2 (Function)
3 (Function)
true
two
1 (Function)
2 (Function)
unknown
unsatisfiable
unsatisfiableWithBacktracking
UpdateT
withHNF
withUnique
xAndYandZ
yes
^: