Module ICurry.Interpreter
- Exported Datatypes
- Exported Functions
Imported modules:

Module ICurry.Interpreter

Author

Michael Hanus, Sascha Ecks

Version

October 2022

A simple interpreter for ICurry based on the a small-step semantics.

The following invariants are required for ICurry programs:

No nested case expression
If there is a case expression, it is on some argument and the argument index is contained in the demand information of the function.

Exported Datatypes:

Control FingerPrint IEnv IOptions State Task

Exported Datatypes

data IOptions

Constructors:

IOptions :: ICOptions -> Bool -> Int -> Int -> IOptions
Fields:
- icOptions :: ICOptions
- showAllExps :: Bool
- waitTime :: Int
- stepNum :: Int

type FingerPrint
                  = [(ChoiceID, Int)]

data Control

Constructors:

CNode :: NodeID -> Control
IBlockEnv :: IBlock -> IEnv -> Control

Known instances:

Show Control

type IEnv
                  = [(IVarIndex, NodeID)]

data Task

Constructors:

Task :: Control -> [(NodeID, Int)] -> FingerPrint -> Task

Known instances:

Show Task

data State

Constructors:

State :: [IFunction] -> Graph -> [Task] -> [NodeID] -> (Maybe NodeID) -> State
Fields:
- program :: [IFunction]
- graph :: Graph
- tasks :: [Task]
- results :: [NodeID]
- currResult :: (Maybe NodeID)

Known instances:

Show State

Exported Functions

defOpts :: IOptions

withGraph :: IOptions -> Int

Further infos:

solution complete, i.e., able to compute all solutions

lookupInEnv :: Int -> [(Int, Int)] -> Int

updateEnv :: [(Int, Int)] -> Int -> Int -> [(Int, Int)]

rootOfTask :: Task -> Int

Further infos:

partially defined

currentNodeOfTask :: Task -> Int

initState :: [IFunction] -> Graph -> Int -> State

Further infos:

solution complete, i.e., able to compute all solutions

rootsOfState :: State -> [Int]

showResults :: State -> String

addResult :: Int -> State -> State

Further infos:

solution complete, i.e., able to compute all solutions

addTGState :: ICOptions -> State -> [State] -> [State]

printState :: IOptions -> State -> IO ()

askProceed :: IOptions -> IO Bool

execProg :: IOptions -> String -> String -> IO [State]

execIProg :: IOptions -> IProg -> String -> IO [State]

runWith :: IOptions -> State -> [State] -> IO (IOptions, [State])

Further infos:

partially defined

evalFun :: IProg -> String -> [String]

step :: State -> State

evalFirstTask :: State -> [Task] -> State

invokeFunction :: State -> [Task] -> State

evalExternal :: Graph -> String -> [Int] -> Node

lookupIntNode :: Int -> Graph -> Int

selectConsBranch :: Node -> [IConsBranch] -> IBlock

selectLitBranch :: Node -> [ILitBranch] -> IBlock

addVarDecls :: Graph -> [(Int, Int)] -> [IVarDecl] -> (Graph, [(Int, Int)])

addAssigns :: Graph -> [(Int, Int)] -> [IAssign] -> (Graph, [(Int, Int)])

replaceNodeArg :: Graph -> Int -> Int -> Int -> Graph

followPath :: Graph -> Int -> [Int] -> Int

extendGraph :: Graph -> [(Int, Int)] -> IExpr -> (Graph, Either Int Node)

Further infos:

partially defined

extendGraphL :: Graph -> [(Int, Int)] -> [IExpr] -> (Graph, [Int])

showILit :: ILiteral -> String

funcOf :: String -> [IFunction] -> IFunction

arityOf :: String -> [IFunction] -> Int

bodyOf :: String -> [IFunction] -> IFuncBody

demandOf :: String -> [IFunction] -> Maybe Int

choiceOfDemand :: State -> Int -> Maybe IExpr

funApply :: IFunction

Further infos:

solution complete, i.e., able to compute all solutions

funSeq :: IFunction

funDollarBang :: IFunction

Further infos:

solution complete, i.e., able to compute all solutions

funDollarDollarBang :: IFunction

funDollarHash :: IFunction

Further infos:

solution complete, i.e., able to compute all solutions

funNormalForm :: IFunction

Further infos:

solution complete, i.e., able to compute all solutions

standardFuncs :: [IFunction]