Agda-2.2.6: A dependently typed functional programming language and proof assistant

Agda.Utils.Trace

Documentation

data ChildCall a Source

Constructors

Child a [ChildCall a] 

Instances

newCall :: a -> Trace a -> Trace aSource

matchCall :: (call -> Maybe a) -> Trace call -> Maybe aSource

matchCalls :: (call -> Maybe a) -> Trace call -> [a]Source

matchTrace :: Monoid m => (ChildCall call -> m) -> Trace call -> mSource