Copyright | (c) Martin Kuehl Uni Bremen 2008-2009 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | mkhl@informatik.uni-bremen.de |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Accessing the Sorts of Maude data types.
Defines a type class HasSorts
that lets us access the Sort
s of Maude
data types as SymbolSet
s.
Consider importing Maude.Meta instead of this module.
The HasSorts type class
class HasSorts a where Source #
getSorts :: a -> SymbolSet Source #
Extract the Sort
s contained in the input.
mapSorts :: SymbolMap -> a -> a Source #
Map the Sort
s contained in the input.
Instances
HasSorts Kind Source # | |
HasSorts Sort Source # | |
HasSorts Type Source # | |
HasSorts Term Source # | |
HasSorts Attr Source # | |
HasSorts Condition Source # | |
HasSorts Rule Source # | |
HasSorts Equation Source # | |
HasSorts Membership Source # | |
Defined in Maude.Meta.HasSorts getSorts :: Membership -> SymbolSet Source # mapSorts :: SymbolMap -> Membership -> Membership Source # | |
HasSorts Operator Source # | |
HasSorts Symbol Source # | |
HasSorts Sentence Source # | |
HasSorts Sign Source # | |
HasSorts KindRel Source # | |
HasSorts a => HasSorts [a] Source # | |
(Ord a, HasSorts a) => HasSorts (Set a) Source # | |
(Ord a, HasSorts a) => HasSorts (Rel a) Source # | |
(HasSorts a, HasSorts b) => HasSorts (a, b) Source # | |
(Ord a, HasSorts a) => HasSorts (Map k a) Source # | |
(HasSorts a, HasSorts b, HasSorts c) => HasSorts (a, b, c) Source # | |