Corresponds to TH's Exp type. Note that DLamE takes names, not patterns.

Declarations as used in a let statement.

Corresponds to TH's Pat type.

Corresponds to TH's Type type.

Corresponds to TH's Kind type, which is a synonym for Type. DKind, though, only contains constructors that make sense for kinds.

Corresponds to TH's Cxt

Corresponds to TH's Pred

Corresponds to TH's TyVarBndr. Note that PlainTV x and KindedTV x StarT are distinct, so we retain that distinction here.

Corresponds to TH's Match type.

Corresponds to TH's Clause type.

Corresponds to TH's Dec type.

Is it a newtype or a data type?

Corresponds to TH's Con type.

A list of fields either for a standard data constructor or a record data constructor.

Corresponds to TH's StrictType type.

Corresponds to TH's VarStrictType type.

Corresponds to TH's Foreign type.

Corresponds to TH's Pragma type.

Corresponds to TH's RuleBndr type.

Corresponds to TH's TySynEqn type (to store type family equations).

Corresponds to TH's Info type.

Role annotations

This class relates a TH type with its th-desugar type and allows conversions back and forth. The functional dependency goes only one way because Type and Kind are type synonyms, but they desugar to different types.

Desugar an expression

Desugar arbitrary Decs

Desugar a type

Desugar a kind

Desugar Info

Desugar a pattern, along with processing a (desugared) expression that is the entire scope of the variables bound in the pattern.

Desugar multiple patterns. Like dsPatOverExp.

Desugar a pattern, returning a list of (Name, DExp) pairs of extra variables that must be bound within the scope of the pattern

Desugar Decs that can appear in a let expression

Desugar a TyVarBndr

Desugar a Cxt

Desugar a single Con.

Desugar a Foreign.

Desugar a Pragma.

Desugar a RuleBndr.

Desugaring a pattern also returns the list of variables bound in as-patterns and the values they should be bound to. This variables must be brought into scope in the "body" of the pattern.

Desugar a Pred, flattening any internal tuples

Desugar a pattern.

Desugar a single Dec, perhaps producing multiple DDecs

Desugar a single Dec, perhaps producing multiple DLetDecs

Desugar a list of matches for a case statement

Desugar a Body

Desugar guarded expressions

Desugar the Stmts in a do expression

Desugar the Stmts in a list or monad comprehension

Desugar clauses to a function definition

Expand all type synonyms and open type families in the desugared abstract syntax tree provided. Normally, the first parameter should have a type like DExp or DLetDec.

Expands all type synonyms in a desugared type. Also expands open type family applications, as long as the arguments have no free variables. Attempts to expand closed type family applications, but aborts the moment it spots anything strange, like a nested type family application or type variable.

Reify a declaration, warning the user about splices if the reify fails. The warning says that reification can fail if you try to reify a type in the same splice as it is declared.

Add a list of declarations to be considered when reifying local declarations.

Like reify, but safer and desugared. Uses local declarations where available.

Like reify from Template Haskell, but looks also in any not-yet-typechecked declarations. To establish this list of not-yet-typechecked declarations, use withLocalDeclarations. Returns Nothing if reification fails. Note that no inferred type information is available from local declarations; bottoms may be used if necessary.

Like reifyWithLocals_maybe, but throws an exception upon failure, warning the user about separating splices.

A DsMonad stores some list of declarations that should be considered in scope. DsM is the prototypical inhabitant of DsMonad.

A convenient implementation of the DsMonad class. Use by calling withLocalDeclarations.

Remove all nested pattern-matches within this expression. This also removes all DTildePas and DBangPas. After this is run, every pattern is guaranteed to be either a DConPa with bare variables as arguments, a DLitPa, or a DWildPa.

Like scExp, but for a DLetDec.

Apply one DExp to a list of arguments

Apply one DType to a list of arguments

Convert a DPat to a DExp. Fails on DWildP.

Remove all wildcards from a pattern, replacing any wildcard with a fresh variable

Extract the TyVarBndrs and constructors given the Name of a type

From the name of a data constructor, retrive the datatype definition it is a part of.

From the name of a data constructor, retrieve its definition as a Con

Check if a name occurs anywhere within a TH tree.

Extract all Names mentioned in a TH tree.

If the declaration passed in is a DValD, creates new, equivalent declarations such that the DPat in all DValDs is just a plain DVarPa. Other declarations are passed through unchanged. Note that the declarations that come out of this function are rather less efficient than those that come in: they have many more pattern matches.

Produces DLetDecs representing the record selector functions from the provided DCon.

Like TH's lookupTypeName, but if this name is not bound, then we assume it is declared in the current module.

Like TH's lookupDataName, but if this name is not bound, then we assume it is declared in the current module.

Like newName, but even more unique (unique across different splices), and with unique nameBases.

Make a tuple DExp from a list of DExps. Avoids using a 1-tuple.

Make a tuple DPat from a list of DPats. Avoids using a 1-tuple.

If decs is non-empty, delcare them in a let:

If matches is non-empty, make a case statement; otherwise make an error statement

Capture-avoiding substitution on types

Extract the degree of a tuple

Extract the degree of a tuple name

Extract the degree of an unboxed tuple

Extract the degree of a tuple name

Extract the names bound in a Stmt

Extract the names bound in a Dec that could appear in a let expression.

Extract the names bound in a Pat