cflp-2009.1.28: Constraint Functional-Logic Programming in HaskellContentsIndex
Search:
!
:!
===
?
after
apply
applyBinCons
applyChoice
ApplyCons
applyCons
applyNotFunction
assertResults
assertResultsLimit
assertResultsN
bfs
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
diag
dNil
Enumerable
enumeration
eval
evalPartial
evalPrint
failure
fair
false
flip
foldr
fun
functionConversion
Generic
generic
genericOps
getRandomGen
groundNormalForm
head
ID
id
ignoreFirstNarrowSecond
ignot
incrementDepth
initID
iterDFS
limDFS
limitDepth
map
mapSharedUnknowns
Match
memberWithFold
Monadic
monadic
Narrow
narrow
negHeads
nil
noDemandOnSharedVar
Nondet
nondet
NormalForm
not
null
oneOf
overApplication
partialNormalForm
patterns
pCons
pFalse
pNil
pointfreeReverse
primitive
pTrue
randomise
Randomiser
resetDepthLimit
Result
reverseWithFoldr
Rnd
RndCtx
rndDFS
setDepthLimit
setRandomGen
sharedCompoundTerms
sharedVarsAreEqual
StoreCTC
tail
tests
1 (Function)
2 (Function)
true
two
1 (Function)
2 (Function)
unknown
UpdateT
withHNF
withUnique
^: