| 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 | None |
Maude.Meta.HasSorts
Contents
Description
Accessing the Sorts of Maude data types.
Defines a type class HasSorts that lets us access the Sorts of Maude
data types as SymbolSets.
Consider importing Maude.Meta instead of this module.
The HasSorts type class
class HasSorts a where
Methods
Extract the Sorts contained in the input.
mapSorts :: SymbolMap -> a -> a
Map the Sorts contained in the input.
Instances
| HasSorts Kind | |
| HasSorts Sort | |
| HasSorts Type | |
| HasSorts Term | |
| HasSorts Attr | |
| HasSorts Condition | |
| HasSorts Rule | |
| HasSorts Equation | |
| HasSorts Membership | |
| HasSorts Operator | |
| HasSorts Symbol | |
| HasSorts Sentence | |
| HasSorts Sign | |
| HasSorts KindRel | |
| HasSorts a => HasSorts [a] | |
| (Ord a, HasSorts a) => HasSorts (Set a) | |
| (Ord a, HasSorts a) => HasSorts (Rel a) | |
| (HasSorts a, HasSorts b) => HasSorts (a, b) | |
| (Ord a, HasSorts a) => HasSorts (Map k a) | |
| (HasSorts a, HasSorts b, HasSorts c) => HasSorts (a, b, c) |