-- | Command Line Configuration Options ----------------------------------------

{-# LANGUAGE DeriveDataTypeable         #-}
{-# LANGUAGE DeriveGeneric #-}

module Language.Haskell.Liquid.UX.Config (
     Config (..)
   , HasConfig (..)
   , Verbosity (..)
   , allowPLE, allowLocalPLE, allowGlobalPLE
   , cmdargsVerbosity
   , patternFlag
   , higherOrderFlag
   , pruneFlag
   , maxCaseExpand
   , exactDCFlag
   , hasOpt
   , totalityCheck
   , terminationCheck
   , structuralTerm
   ) where

import Prelude hiding (error)
import Language.Fixpoint.Types.Config hiding (Config)
import GHC.Generics
import System.Console.CmdArgs hiding (Verbosity(..))
import qualified System.Console.CmdArgs as CmdArgs

data Verbosity = Quiet | Minimal | Normal | Loud
  deriving (Typeable Verbosity
Typeable Verbosity =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> Verbosity -> c Verbosity)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Verbosity)
-> (Verbosity -> Constr)
-> (Verbosity -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Verbosity))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Verbosity))
-> ((forall b. Data b => b -> b) -> Verbosity -> Verbosity)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> Verbosity -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> Verbosity -> r)
-> (forall u. (forall d. Data d => d -> u) -> Verbosity -> [u])
-> (forall u.
    Int -> (forall d. Data d => d -> u) -> Verbosity -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Verbosity -> m Verbosity)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Verbosity -> m Verbosity)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Verbosity -> m Verbosity)
-> Data Verbosity
Verbosity -> Constr
Verbosity -> DataType
(forall b. Data b => b -> b) -> Verbosity -> Verbosity
forall a.
Typeable a =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Verbosity -> u
forall u. (forall d. Data d => d -> u) -> Verbosity -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Verbosity -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Verbosity -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Verbosity -> m Verbosity
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Verbosity -> m Verbosity
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Verbosity
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Verbosity -> c Verbosity
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Verbosity)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Verbosity)
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Verbosity -> c Verbosity
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Verbosity -> c Verbosity
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Verbosity
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Verbosity
$ctoConstr :: Verbosity -> Constr
toConstr :: Verbosity -> Constr
$cdataTypeOf :: Verbosity -> DataType
dataTypeOf :: Verbosity -> DataType
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Verbosity)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Verbosity)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Verbosity)
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Verbosity)
$cgmapT :: (forall b. Data b => b -> b) -> Verbosity -> Verbosity
gmapT :: (forall b. Data b => b -> b) -> Verbosity -> Verbosity
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Verbosity -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Verbosity -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Verbosity -> r
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Verbosity -> r
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Verbosity -> [u]
gmapQ :: forall u. (forall d. Data d => d -> u) -> Verbosity -> [u]
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Verbosity -> u
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Verbosity -> u
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Verbosity -> m Verbosity
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Verbosity -> m Verbosity
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Verbosity -> m Verbosity
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Verbosity -> m Verbosity
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Verbosity -> m Verbosity
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Verbosity -> m Verbosity
Data, (forall x. Verbosity -> Rep Verbosity x)
-> (forall x. Rep Verbosity x -> Verbosity) -> Generic Verbosity
forall x. Rep Verbosity x -> Verbosity
forall x. Verbosity -> Rep Verbosity x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cfrom :: forall x. Verbosity -> Rep Verbosity x
from :: forall x. Verbosity -> Rep Verbosity x
$cto :: forall x. Rep Verbosity x -> Verbosity
to :: forall x. Rep Verbosity x -> Verbosity
Generic, Int -> Verbosity -> ShowS
[Verbosity] -> ShowS
Verbosity -> String
(Int -> Verbosity -> ShowS)
-> (Verbosity -> String)
-> ([Verbosity] -> ShowS)
-> Show Verbosity
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> Verbosity -> ShowS
showsPrec :: Int -> Verbosity -> ShowS
$cshow :: Verbosity -> String
show :: Verbosity -> String
$cshowList :: [Verbosity] -> ShowS
showList :: [Verbosity] -> ShowS
Show, Verbosity -> Verbosity -> Bool
(Verbosity -> Verbosity -> Bool)
-> (Verbosity -> Verbosity -> Bool) -> Eq Verbosity
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: Verbosity -> Verbosity -> Bool
== :: Verbosity -> Verbosity -> Bool
$c/= :: Verbosity -> Verbosity -> Bool
/= :: Verbosity -> Verbosity -> Bool
Eq, Eq Verbosity
Eq Verbosity =>
(Verbosity -> Verbosity -> Ordering)
-> (Verbosity -> Verbosity -> Bool)
-> (Verbosity -> Verbosity -> Bool)
-> (Verbosity -> Verbosity -> Bool)
-> (Verbosity -> Verbosity -> Bool)
-> (Verbosity -> Verbosity -> Verbosity)
-> (Verbosity -> Verbosity -> Verbosity)
-> Ord Verbosity
Verbosity -> Verbosity -> Bool
Verbosity -> Verbosity -> Ordering
Verbosity -> Verbosity -> Verbosity
forall a.
Eq a =>
(a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
$ccompare :: Verbosity -> Verbosity -> Ordering
compare :: Verbosity -> Verbosity -> Ordering
$c< :: Verbosity -> Verbosity -> Bool
< :: Verbosity -> Verbosity -> Bool
$c<= :: Verbosity -> Verbosity -> Bool
<= :: Verbosity -> Verbosity -> Bool
$c> :: Verbosity -> Verbosity -> Bool
> :: Verbosity -> Verbosity -> Bool
$c>= :: Verbosity -> Verbosity -> Bool
>= :: Verbosity -> Verbosity -> Bool
$cmax :: Verbosity -> Verbosity -> Verbosity
max :: Verbosity -> Verbosity -> Verbosity
$cmin :: Verbosity -> Verbosity -> Verbosity
min :: Verbosity -> Verbosity -> Verbosity
Ord)

-- | liquid-fixpoint uses CmdArg.Verbosity at least to show the progress bar.
cmdargsVerbosity :: Verbosity -> CmdArgs.Verbosity
cmdargsVerbosity :: Verbosity -> Verbosity
cmdargsVerbosity Verbosity
Quiet   = Verbosity
CmdArgs.Quiet
cmdargsVerbosity Verbosity
Minimal = Verbosity
CmdArgs.Quiet
cmdargsVerbosity Verbosity
Normal  = Verbosity
CmdArgs.Normal
cmdargsVerbosity Verbosity
Loud    = Verbosity
CmdArgs.Loud


-- NOTE: adding strictness annotations breaks the help message
data Config = Config
  { Config -> Verbosity
loggingVerbosity         :: Verbosity  -- ^ the logging verbosity to use (defaults to 'Minimal')
  , Config -> [String]
files                    :: [FilePath] -- ^ source files to check
  , Config -> [String]
idirs                    :: [FilePath] -- ^ path to directory for including specs
  , Config -> Bool
diffcheck                :: Bool       -- ^ check subset of binders modified (+ dependencies) since last check
  , Config -> Bool
linear                   :: Bool       -- ^ uninterpreted integer multiplication and division
  , Config -> Bool
stringTheory             :: Bool       -- ^ interpretation of string theory in the logic
  , Config -> Bool
higherorder              :: Bool       -- ^ allow higher order binders into the logic
  , Config -> Bool
higherorderqs            :: Bool       -- ^ allow higher order qualifiers
  , Config -> Maybe Int
smtTimeout               :: Maybe Int  -- ^ smt timeout
  , Config -> Bool
fullcheck                :: Bool       -- ^ check all binders (overrides diffcheck)
  , Config -> Bool
saveQuery                :: Bool       -- ^ save fixpoint query
  , Config -> [String]
checks                   :: [String]   -- ^ set of binders to check
  , Config -> Bool
noCheckUnknown           :: Bool       -- ^ whether to complain about specifications for unexported and unused values
  , Config -> Bool
notermination            :: Bool       -- ^ disable termination check
  , Config -> Bool
nopositivity             :: Bool       -- ^ disable positivity check
  , Config -> Bool
rankNTypes               :: Bool       -- ^ Adds precise reasoning on presence of rankNTypes
  , Config -> Bool
noclasscheck             :: Bool       -- ^ disable checking class instances
  -- , structuralTerm        :: Bool       -- ^ use structural termination checker
  , Config -> Bool
nostructuralterm         :: Bool       -- ^ disable structural termination check
  , Config -> Bool
gradual                  :: Bool       -- ^ enable gradual type checking
  , Config -> Bool
bscope                   :: Bool       -- ^ scope of the outer binders on the inner refinements
  , Config -> Int
gdepth                   :: Int        -- ^ depth of gradual concretization
  , Config -> Bool
ginteractive             :: Bool       -- ^ interactive gradual solving
  , Config -> Bool
totalHaskell             :: Bool       -- ^ Check for termination and totality, Overrides no-termination flags
  , Config -> Bool
nowarnings               :: Bool       -- ^ disable warnings output (only show errors)
  , Config -> Bool
noannotations            :: Bool       -- ^ disable creation of intermediate annotation files
  , Config -> Bool
checkDerived             :: Bool       -- ^ check internal (GHC-derived) binders
  , Config -> Int
caseExpandDepth          :: Int        -- ^ maximum case expand nesting depth.
  , Config -> Bool
notruetypes              :: Bool       -- ^ disable truing top level types
  , Config -> Bool
nototality               :: Bool       -- ^ disable totality check in definitions
  , Config -> Bool
pruneUnsorted            :: Bool       -- ^ enable prunning unsorted Refinements
  , Config -> Maybe Int
cores                    :: Maybe Int  -- ^ number of cores used to solve constraints
  , Config -> Int
minPartSize              :: Int        -- ^ Minimum size of a partition
  , Config -> Int
maxPartSize              :: Int        -- ^ Maximum size of a partition. Overrides minPartSize
  , Config -> Int
maxParams                :: Int        -- ^ the maximum number of parameters to accept when mining qualifiers
  , Config -> Maybe SMTSolver
smtsolver                :: Maybe SMTSolver  -- ^ name of smtsolver to use [default: try z3, cvc4, mathsat in order]
  , Config -> Bool
shortNames               :: Bool       -- ^ drop module qualifers from pretty-printed names.
  , Config -> Bool
shortErrors              :: Bool       -- ^ don't show subtyping errors and contexts.
  , Config -> Bool
cabalDir                 :: Bool       -- ^ find and use .cabal file to include paths to sources for imported modules
  , Config -> [String]
ghcOptions               :: [String]   -- ^ command-line options to pass to GHC
  , Config -> [String]
cFiles                   :: [String]   -- ^ .c files to compile and link against (for GHC)
  , Config -> Eliminate
eliminate                :: Eliminate  -- ^ eliminate (i.e. don't use qualifs for) for "none", "cuts" or "all" kvars
  , Config -> Int
port                     :: Int        -- ^ port at which lhi should listen
  , Config -> Bool
exactDC                  :: Bool       -- ^ Automatically generate singleton types for data constructors
  , Config -> Bool
noADT                    :: Bool       -- ^ Disable ADTs (only used with exactDC)
  , Config -> [String]
expectErrorContaining    :: [String]   -- ^ expect failure from Liquid with at least one of the following messages
  , Config -> Bool
expectAnyError           :: Bool       -- ^ expect failure from Liquid with any message
  , Config -> Bool
scrapeInternals          :: Bool       -- ^ scrape qualifiers from auto specifications
  , Config -> Bool
elimStats                :: Bool       -- ^ print eliminate stats
  , Config -> Maybe Int
elimBound                :: Maybe Int  -- ^ eliminate upto given depth of KVar chains
  , Config -> Bool
json                     :: Bool       -- ^ print results (safe/errors) as JSON
  , Config -> Bool
counterExamples          :: Bool       -- ^ attempt to generate counter-examples to type errors
  , Config -> Bool
timeBinds                :: Bool       -- ^ check and time each (asserted) type-sig separately
  , Config -> Bool
noPatternInline          :: Bool       -- ^ treat code patterns (e.g. e1 >>= \x -> e2) specially for inference
  , Config -> Bool
untidyCore               :: Bool       -- ^ print full blown core (with untidy names) in verbose mode
  , Config -> Bool
noSimplifyCore           :: Bool       -- ^ simplify GHC core before constraint-generation
  -- PLE-OPT , autoInst      ntiate :: Instantiate -- ^ How to instantiate axioms
  , Config -> Bool
noslice                  :: Bool       -- ^ Disable non-concrete KVar slicing
  , Config -> Bool
noLiftedImport           :: Bool       -- ^ Disable loading lifted specifications (for "legacy" libs)
  , Config -> Bool
proofLogicEval           :: Bool       -- ^ Enable proof-by-logical-evaluation
  , Config -> Bool
pleWithUndecidedGuards   :: Bool       -- ^ Unfold invocations with undecided guards in PLE
  , Config -> Bool
oldPLE                   :: Bool       -- ^ Enable proof-by-logical-evaluation
  , Config -> Bool
interpreter              :: Bool       -- ^ Use an interpreter to assist PLE
  , Config -> Bool
proofLogicEvalLocal      :: Bool       -- ^ Enable proof-by-logical-evaluation locally, per function
  , Config -> Bool
etabeta                  :: Bool       -- ^ Eta expand and beta reduce terms to aid PLE
  , Config -> Bool
dependantCase            :: Bool       -- ^ Enable PLE for dependent cases
  , Config -> Bool
extensionality           :: Bool       -- ^ Enable extensional interpretation of function equality
  , Config -> Bool
nopolyinfer              :: Bool       -- ^ No inference of polymorphic type application.
  , Config -> Bool
reflection               :: Bool       -- ^ Allow "reflection"; switches on "--higherorder" and "--exactdc"
  , Config -> Bool
compileSpec              :: Bool       -- ^ Only "compile" the spec -- into .bspec file -- don't do any checking.
  , Config -> Bool
noCheckImports           :: Bool       -- ^ Do not check the transitive imports
  , Config -> Bool
typeclass                :: Bool        -- ^ enable typeclass support.
  , Config -> Bool
auxInline                :: Bool        -- ^ 
  , Config -> Bool
rwTerminationCheck       :: Bool       -- ^ Enable termination checking for rewriting
  , Config -> Bool
skipModule               :: Bool       -- ^ Skip this module entirely (don't even compile any specs in it)
  , Config -> Bool
noLazyPLE                :: Bool
  , Config -> Maybe Int
fuel                     :: Maybe Int  -- ^ Maximum PLE "fuel" (unfold depth) (default=infinite) 
  , Config -> Bool
environmentReduction     :: Bool       -- ^ Perform environment reduction
  , Config -> Bool
noEnvironmentReduction   :: Bool       -- ^ Don't perform environment reduction
  , Config -> Bool
inlineANFBindings        :: Bool       -- ^ Inline ANF bindings.
                                           -- Sometimes improves performance and sometimes worsens it.
  , Config -> Bool
pandocHtml               :: Bool       -- ^ Use pandoc to generate html
  , Config -> [String]
excludeAutomaticAssumptionsFor :: [String]
  , Config -> Bool
dumpOpaqueReflections    :: Bool       -- Dumps all opaque reflections to the stdout
  , Config -> Bool
dumpPreNormalizedCore    :: Bool       -- Dumps the prenormalized core (before a-normalization)
  , Config -> Bool
allowUnsafeConstructors  :: Bool       -- ^ Allow refining constructors with unsafe refinements
  } deriving ((forall x. Config -> Rep Config x)
-> (forall x. Rep Config x -> Config) -> Generic Config
forall x. Rep Config x -> Config
forall x. Config -> Rep Config x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cfrom :: forall x. Config -> Rep Config x
from :: forall x. Config -> Rep Config x
$cto :: forall x. Rep Config x -> Config
to :: forall x. Rep Config x -> Config
Generic, Typeable Config
Typeable Config =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> Config -> c Config)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Config)
-> (Config -> Constr)
-> (Config -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Config))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Config))
-> ((forall b. Data b => b -> b) -> Config -> Config)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> Config -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> Config -> r)
-> (forall u. (forall d. Data d => d -> u) -> Config -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Config -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Config -> m Config)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Config -> m Config)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Config -> m Config)
-> Data Config
Config -> Constr
Config -> DataType
(forall b. Data b => b -> b) -> Config -> Config
forall a.
Typeable a =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Config -> u
forall u. (forall d. Data d => d -> u) -> Config -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Config -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Config -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Config -> m Config
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Config -> m Config
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Config
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Config -> c Config
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Config)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Config)
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Config -> c Config
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Config -> c Config
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Config
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Config
$ctoConstr :: Config -> Constr
toConstr :: Config -> Constr
$cdataTypeOf :: Config -> DataType
dataTypeOf :: Config -> DataType
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Config)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Config)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Config)
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Config)
$cgmapT :: (forall b. Data b => b -> b) -> Config -> Config
gmapT :: (forall b. Data b => b -> b) -> Config -> Config
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Config -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Config -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Config -> r
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Config -> r
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Config -> [u]
gmapQ :: forall u. (forall d. Data d => d -> u) -> Config -> [u]
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Config -> u
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Config -> u
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Config -> m Config
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Config -> m Config
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Config -> m Config
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Config -> m Config
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Config -> m Config
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Config -> m Config
Data, Typeable, Int -> Config -> ShowS
[Config] -> ShowS
Config -> String
(Int -> Config -> ShowS)
-> (Config -> String) -> ([Config] -> ShowS) -> Show Config
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> Config -> ShowS
showsPrec :: Int -> Config -> ShowS
$cshow :: Config -> String
show :: Config -> String
$cshowList :: [Config] -> ShowS
showList :: [Config] -> ShowS
Show, Config -> Config -> Bool
(Config -> Config -> Bool)
-> (Config -> Config -> Bool) -> Eq Config
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: Config -> Config -> Bool
== :: Config -> Config -> Bool
$c/= :: Config -> Config -> Bool
/= :: Config -> Config -> Bool
Eq)

allowPLE :: Config -> Bool
allowPLE :: Config -> Bool
allowPLE Config
cfg
  =  Config -> Bool
allowGlobalPLE Config
cfg
  Bool -> Bool -> Bool
|| Config -> Bool
allowLocalPLE Config
cfg

allowGlobalPLE :: Config -> Bool
allowGlobalPLE :: Config -> Bool
allowGlobalPLE Config
cfg = Config -> Bool
proofLogicEval  Config
cfg

allowLocalPLE :: Config -> Bool
allowLocalPLE :: Config -> Bool
allowLocalPLE Config
cfg = Config -> Bool
proofLogicEvalLocal  Config
cfg

instance HasConfig  Config where
  getConfig :: Config -> Config
getConfig Config
x = Config
x

class HasConfig t where
  getConfig :: t -> Config

patternFlag :: (HasConfig t) => t -> Bool
patternFlag :: forall t. HasConfig t => t -> Bool
patternFlag = Bool -> Bool
not (Bool -> Bool) -> (t -> Bool) -> t -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Config -> Bool
noPatternInline (Config -> Bool) -> (t -> Config) -> t -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. t -> Config
forall t. HasConfig t => t -> Config
getConfig

higherOrderFlag :: (HasConfig t) => t -> Bool
higherOrderFlag :: forall t. HasConfig t => t -> Bool
higherOrderFlag t
x = Config -> Bool
higherorder Config
cfg Bool -> Bool -> Bool
|| Config -> Bool
reflection Config
cfg
  where
    cfg :: Config
cfg           = t -> Config
forall t. HasConfig t => t -> Config
getConfig t
x

exactDCFlag :: (HasConfig t) => t -> Bool
exactDCFlag :: forall t. HasConfig t => t -> Bool
exactDCFlag t
x = Config -> Bool
exactDC Config
cfg Bool -> Bool -> Bool
|| Config -> Bool
reflection Config
cfg
  where
    cfg :: Config
cfg       = t -> Config
forall t. HasConfig t => t -> Config
getConfig t
x

pruneFlag :: (HasConfig t) => t -> Bool
pruneFlag :: forall t. HasConfig t => t -> Bool
pruneFlag = Config -> Bool
pruneUnsorted (Config -> Bool) -> (t -> Config) -> t -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. t -> Config
forall t. HasConfig t => t -> Config
getConfig

maxCaseExpand :: (HasConfig t) => t -> Int
maxCaseExpand :: forall t. HasConfig t => t -> Int
maxCaseExpand = Config -> Int
caseExpandDepth (Config -> Int) -> (t -> Config) -> t -> Int
forall b c a. (b -> c) -> (a -> b) -> a -> c
. t -> Config
forall t. HasConfig t => t -> Config
getConfig

hasOpt :: (HasConfig t) => t -> (Config -> Bool) -> Bool
hasOpt :: forall t. HasConfig t => t -> (Config -> Bool) -> Bool
hasOpt t
t Config -> Bool
f = Config -> Bool
f (t -> Config
forall t. HasConfig t => t -> Config
getConfig t
t)

totalityCheck :: (HasConfig t) => t -> Bool
totalityCheck :: forall t. HasConfig t => t -> Bool
totalityCheck = Config -> Bool
totalityCheck' (Config -> Bool) -> (t -> Config) -> t -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. t -> Config
forall t. HasConfig t => t -> Config
getConfig

terminationCheck :: (HasConfig t) => t -> Bool
terminationCheck :: forall t. HasConfig t => t -> Bool
terminationCheck = Config -> Bool
terminationCheck' (Config -> Bool) -> (t -> Config) -> t -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. t -> Config
forall t. HasConfig t => t -> Config
getConfig

totalityCheck' :: Config -> Bool
totalityCheck' :: Config -> Bool
totalityCheck' Config
cfg = Bool -> Bool
not (Config -> Bool
nototality Config
cfg) Bool -> Bool -> Bool
|| Config -> Bool
totalHaskell Config
cfg

terminationCheck' :: Config -> Bool
terminationCheck' :: Config -> Bool
terminationCheck' Config
cfg = Config -> Bool
totalHaskell Config
cfg Bool -> Bool -> Bool
|| Bool -> Bool
not (Config -> Bool
notermination Config
cfg)

structuralTerm :: (HasConfig a) => a -> Bool
structuralTerm :: forall t. HasConfig t => t -> Bool
structuralTerm = Bool -> Bool
not (Bool -> Bool) -> (a -> Bool) -> a -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Config -> Bool
nostructuralterm (Config -> Bool) -> (a -> Config) -> a -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> Config
forall t. HasConfig t => t -> Config
getConfig