Safe Haskell | None |
---|---|
Language | Haskell2010 |
- class Typeable a => Resolvable a where
- newtype Alg w = Alg {
- runAlg :: forall d. Resolvable d => d -> Scope -> w d
- rmap :: Resolvable a => (forall b. Resolvable b => Scope -> b -> b) -> Scope -> a -> a
- rfoldMap :: (Monoid r, Resolvable a) => (forall b. Resolvable b => Scope -> b -> r) -> Scope -> a -> r
- data Scope
- data NameContext
- initialScope :: ModuleName () -> Table -> Scope
- gTable :: Lens Scope Table
- lTable :: Lens Scope Table
- nameCtx :: Lens Scope NameContext
- type WcNames = [WcField]
- data WcField = WcField {
- wcFieldName :: Name ()
- wcFieldModuleName :: ModuleName ()
- wcExistsGlobalValue :: Bool
- wcNames :: Lens Scope WcNames
Documentation
class Typeable a => Resolvable a where Source #
A type that implements Resolvable
provides a way to perform
a shallow scope-aware traversal.
(Typeable * a, GTraversable Resolvable a) => Resolvable a Source # | |
The algebra for rtraverse
. It's newtype-wrapped because an implicit
parameter cannot be polymorphic.
Alg | |
|
rmap :: Resolvable a => (forall b. Resolvable b => Scope -> b -> b) -> Scope -> a -> a Source #
Analogous to gmap
, but for Resolvable
rfoldMap :: (Monoid r, Resolvable a) => (forall b. Resolvable b => Scope -> b -> r) -> Scope -> a -> r Source #
Analogous to gmap
, but for Resolvable
data NameContext Source #
Describes how we should treat names in the current context
BindingT | |
BindingV | |
ReferenceT | |
ReferenceV | |
ReferenceUV | Reference a method in an instance declaration Unqualified names also match qualified names in scope https://www.haskell.org/pipermail/haskell-prime/2008-April/002569.html |
ReferenceUT | Reference an associated type in an instance declaration Unqualified names also match qualified names in scope https://www.haskell.org/pipermail/haskell-prime/2008-April/002569.html |
SignatureV | A type signature contains an always unqualified |
Other |
initialScope :: ModuleName () -> Table -> Scope Source #
Create an initial scope
type WcNames = [WcField] Source #
Information about the names being introduced by a record wildcard
During resolving traversal, we always (lazily) construct this list when we process PRec or RecConstr, even if it doesn't contain a wildcard.
Then, if the pattern or construction actually contains a wildcard, we use the computed value.
Information about a field in the wildcard
WcField | |
|