Copyright | (C) 2017 Google Inc. |
---|---|
License | BSD2 (see the file LICENSE) |
Maintainer | Christiaan Baaij <christiaan.baaij@gmail.com> |
Safe Haskell | None |
Language | Haskell2010 |
Names
Synopsis
- data NameSort
- type OccName a = Name a
- data Name a = Name {}
- name2String :: Name a -> String
- name2Integer :: Name a -> Integer
- string2OccName :: String -> OccName a
- string2SystemName :: String -> Name a
- string2InternalName :: String -> Name a
- makeOccName :: String -> Integer -> OccName a
- makeSystemName :: String -> Integer -> Name a
- coerceName :: Name a -> Name b
- appendToName :: Name a -> String -> Name a
- noSrcSpan :: SrcSpan
Documentation
Instances
Eq NameSort Source # | |
Ord NameSort Source # | |
Show NameSort Source # | |
Generic NameSort Source # | |
Hashable NameSort Source # | |
NFData NameSort Source # | |
Alpha NameSort Source # | |
aeq' :: AlphaCtx -> NameSort -> NameSort -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> NameSort -> f NameSort # close :: AlphaCtx -> NamePatFind -> NameSort -> NameSort # open :: AlphaCtx -> NthPatFind -> NameSort -> NameSort # isPat :: NameSort -> DisjointSet AnyName # nthPatFind :: NameSort -> NthPatFind # namePatFind :: NameSort -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> NameSort -> NameSort # lfreshen' :: LFresh m => AlphaCtx -> NameSort -> (NameSort -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> NameSort -> m (NameSort, Perm AnyName) # | |
type Rep NameSort Source # | |
Instances
name2String :: Name a -> String Source #
name2Integer :: Name a -> Integer Source #
string2OccName :: String -> OccName a Source #
string2SystemName :: String -> Name a Source #
string2InternalName :: String -> Name a Source #
coerceName :: Name a -> Name b Source #