 | cflp-2009.2.1: Constraint Functional-Logic Programming in Haskell | Source code | Contents | Index |
| CFLP.Strategies |
| type Computation a = forall s. (CFLP s, BooleanSolver (Ctx s)) => Context (Ctx s) -> ID -> Data s a | Source |
| dfs :: [CTC (Monadic (UpdateT (StoreCTC ()) [])) (StoreCTC ())] | Source |
| limDFS :: Int -> [CTC (Depth (DepthLim (Monadic (UpdateT (StoreCTC (DepthCtx (DepthLimCtx ()))) [])))) (StoreCTC (DepthCtx (DepthLimCtx ())))] | Source |
| iterDFS :: [CTC (Depth (DepthLim (Monadic (UpdateT (StoreCTC (DepthCtx (DepthLimCtx ()))) [])))) (StoreCTC (DepthCtx (DepthLimCtx ())))] | Source |
| bfs :: [CTC (Monadic (UpdateT (StoreCTC ()) Levels)) (StoreCTC ())] | Source |
| diag :: [CTC (Monadic (UpdateT (StoreCTC ()) Omega)) (StoreCTC ())] | Source |
| fair :: [CTC (Monadic (UpdateT (StoreCTC ()) Stream)) (StoreCTC ())] | Source |
| rndDFS :: [CTC (Rnd (Monadic (UpdateT (StoreCTC (RndCtx ())) []))) (StoreCTC (RndCtx ()))] | Source |
| dfs_B :: [CTC (Sat (Monadic (UpdateT (StoreCTC (SatCtx ())) []))) (StoreCTC (SatCtx ()))] | Source |
| limDFS_B :: Int -> [CTC (Depth (DepthLim (Sat (Monadic (UpdateT (StoreCTC (DepthCtx (DepthLimCtx (SatCtx ())))) []))))) (StoreCTC (DepthCtx (DepthLimCtx (SatCtx ()))))] | Source |
| iterDFS_B :: [CTC (Depth (DepthLim (Sat (Monadic (UpdateT (StoreCTC (DepthCtx (DepthLimCtx (SatCtx ())))) []))))) (StoreCTC (DepthCtx (DepthLimCtx (SatCtx ()))))] | Source |
| bfs_B :: [CTC (Sat (Monadic (UpdateT (StoreCTC (SatCtx ())) Levels))) (StoreCTC (SatCtx ()))] | Source |
| diag_B :: [CTC (Sat (Monadic (UpdateT (StoreCTC (SatCtx ())) Omega))) (StoreCTC (SatCtx ()))] | Source |
| fair_B :: [CTC (Sat (Monadic (UpdateT (StoreCTC (SatCtx ())) Stream))) (StoreCTC (SatCtx ()))] | Source |
| rndDFS_B :: [CTC (Rnd (Sat (Monadic (UpdateT (StoreCTC (RndCtx (SatCtx ()))) [])))) (StoreCTC (RndCtx (SatCtx ())))] | Source |