|
definition:
|
translateDefaultRulesAndDetOps :: Int -> [String] -> String -> CurryProg
-> IO (Maybe CurryProg)
translateDefaultRulesAndDetOps verb moreopts _ prog = do
when (verb>1) $ putStr banner
trscm <- processOpts moreopts
when (verb>1) $ putStrLn ("Translation scheme: " ++ show trscm)
mbtransprog <- translateProg verb trscm prog
maybe (return Nothing)
(\ (detfuncnames,newprog) -> do
-- check whether we have files with determinism proofs:
let mname = progName prog
prfiles <- getModuleProofFiles (takeDirectory (modNameToPath mname)) mname
detfuncnamesWOproofs <- filterProofObligation verb prfiles detfuncnames
when (verb>0) $ printProofObligation detfuncnamesWOproofs
return (Just newprog))
mbtransprog
where
processOpts opts = case opts of
[] -> return defaultTransScheme
[scheme] ->
if scheme == "nodupscheme"
then if curryCompiler == "kics2"
then return SpecScheme -- due to bug in KiCS2!!!
else return NoDupScheme
else if scheme == "specscheme"
then return SpecScheme
else showError
_ -> showError
where
showError = do
putStrLn $ "Unknown options (ignored): " ++ unwords opts
return defaultTransScheme
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
------------------------------------------------------------------------
--- Start default rules/deterministic operations transformation
--- in "preprocessor mode".
--- It is assumed that the Curry program passed as the last argument
--- was read with `readUntypedCurry` which is important to
--- process DET annotations!
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_) |-> _}
|
|
name:
|
translateDefaultRulesAndDetOps
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Int -> [String] -> String -> AbstractCurry.Types.CurryProg
-> Prelude.IO (Prelude.Maybe AbstractCurry.Types.CurryProg)
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|