Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Stepping Methods
- type LiveState = ([Rule], State)
- type DeadState = ([Rule], State)
- runBoundedBFS :: Int -> State -> ([LiveState], [DeadState])
- runBoundedBFSLogged :: Int -> State -> [([LiveState], [DeadState])]
- runBoundedDFS :: Int -> State -> ([LiveState], [DeadState])
- runBoundedDFSLogged :: Int -> State -> [([LiveState], [DeadState])]
Documentation
runBoundedBFS :: Int -> State -> ([LiveState], [DeadState]) Source #
Run bounded breadth-first-search of the execution space with an Int
to
denote the maximum number of steps to take.
runBoundedBFSLogged :: Int -> State -> [([LiveState], [DeadState])] Source #
Run bounded breadth-first-search of the execution state with an Int
to
denote the maximum number of steps to take. We keep a list to track
a history of all the execution snapshots. As it stands, this is currently
very NOT optimized.