Safe Haskell | None |
---|---|
Language | Haskell2010 |
Static analysis of Michelson code.
Synopsis
- data AnalyzerRes = AnalyzerRes {}
- analyze :: Instr inp out -> AnalyzerRes
Documentation
data AnalyzerRes Source #
AnalyzerRes | |
|
Instances
Eq AnalyzerRes Source # | |
Defined in Michelson.Analyzer (==) :: AnalyzerRes -> AnalyzerRes -> Bool # (/=) :: AnalyzerRes -> AnalyzerRes -> Bool # | |
Show AnalyzerRes Source # | |
Defined in Michelson.Analyzer showsPrec :: Int -> AnalyzerRes -> ShowS # show :: AnalyzerRes -> String # showList :: [AnalyzerRes] -> ShowS # | |
Semigroup AnalyzerRes Source # | |
Defined in Michelson.Analyzer (<>) :: AnalyzerRes -> AnalyzerRes -> AnalyzerRes # sconcat :: NonEmpty AnalyzerRes -> AnalyzerRes # stimes :: Integral b => b -> AnalyzerRes -> AnalyzerRes # | |
Monoid AnalyzerRes Source # | |
Defined in Michelson.Analyzer mempty :: AnalyzerRes # mappend :: AnalyzerRes -> AnalyzerRes -> AnalyzerRes # mconcat :: [AnalyzerRes] -> AnalyzerRes # | |
Buildable AnalyzerRes Source # | |
Defined in Michelson.Analyzer build :: AnalyzerRes -> Builder # |
analyze :: Instr inp out -> AnalyzerRes Source #
Statically analyze an instruction. Typed representation is used because it's easier to analyze. It means that we can't analyze ill-typed contracts, but hopefully it's not a serious limitation.