Hets - the Heterogeneous Tool Set

Copyright(c) Martin Kuehl Uni Bremen 2008-2009
LicenseGPLv2 or higher, see LICENSE.txt
Maintainermkhl@informatik.uni-bremen.de
Stabilityexperimental
Portabilityportable
Safe HaskellSafe

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.

Synopsis

The HasSorts type class

class HasSorts a where Source #

Represents something that contains a Set of Sorts (as Symbols).

Minimal complete definition

getSorts, mapSorts

Methods

getSorts :: a -> SymbolSet Source #

Extract the Sorts contained in the input.

mapSorts :: SymbolMap -> a -> a Source #

Map the Sorts 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 # 
HasSorts Operator Source # 
HasSorts Symbol Source # 
HasSorts Sentence Source # 
HasSorts Sign Source # 
HasSorts a => HasSorts [a] Source # 

Methods

getSorts :: [a] -> SymbolSet Source #

mapSorts :: SymbolMap -> [a] -> [a] Source #

(Ord a, HasSorts a) => HasSorts (Set a) Source # 

Methods

getSorts :: Set a -> SymbolSet Source #

mapSorts :: SymbolMap -> Set a -> Set a Source #

(Ord a, HasSorts a) => HasSorts (Rel a) Source # 
(HasSorts a, HasSorts b) => HasSorts (a, b) Source # 

Methods

getSorts :: (a, b) -> SymbolSet Source #

mapSorts :: SymbolMap -> (a, b) -> (a, b) Source #

(Ord a, HasSorts a) => HasSorts (Map k a) Source # 

Methods

getSorts :: Map k a -> SymbolSet Source #

mapSorts :: SymbolMap -> Map k a -> Map k a Source #

(HasSorts a, HasSorts b, HasSorts c) => HasSorts (a, b, c) Source # 

Methods

getSorts :: (a, b, c) -> SymbolSet Source #

mapSorts :: SymbolMap -> (a, b, c) -> (a, b, c) Source #