HORIZON HASKELLDocslts/ghc-9.14.x3e2d5682026-10-11Search names, modules, packages, or :: a typeCtrl K

GHC 9.14.1 · lts/ghc-9.14.x · 3e2d568 · 2026-10-11

ModuleAgda-2.8.0.2Haskell2010

Agda.Syntax.Common

Some common syntactic entities are defined in this module.

  • 91 types
  • 22 classes
  • 198 values
  • PackageAgda-2.8.0.2
  • Exports312
  • LanguageHaskell2010
  • LicenceMIT
  • SourceCommon.hs
valueapplyCohesion :: LensCohesion a => Cohesion -> a -> a
#

Compose with cohesion flag from the left. This function is e.g. used to update the cohesion information on pattern variables a after a match against something of cohesion rel.

valueapplyModality :: LensModality a => Modality -> a -> a
#

Compose with modality flag from the left. This function is e.g. used to update the modality information on pattern variables a after a match against something of modality q.

Compose with polarity flag from the left. This function is e.g. used to update the polarity information on pattern variables a after a match against something of polarity pol.

valueapplyQuantity :: LensQuantity a => Quantity -> a -> a
#

Compose with quantity flag from the left. This function is e.g. used to update the quantity information on pattern variables a after a match against something of quantity q.

valueapplyRelevance :: LensRelevance a => Relevance -> a -> a
#

Compose with relevance flag from the left. This function is e.g. used to update the relevance information on pattern variables a after a match against something rel.

The default Modality Beware that this is neither the additive unit nor the unit under composition, because the default quantity is ω.

Absorptive element! This differs from Relevance and Cohesion whose default is the multiplicative unit.

inverseComposeCohesion r x returns the least y such that forall x, y we have x `moreCohesion` (r `composeCohesion` y) iff (r `inverseComposeCohesion` x) `moreCohesion` y (Galois connection). The above law fails for r = Squash.

inverseComposeModality r x returns the least modality y such that forall x, y we have x `moreUsableModality` (r `composeModality` y) iff (r `inverseComposeModality` x) `moreUsableModality` y (Galois connection).

inverseComposeQuantity r x returns the least quantity y such that forall x, y we have x `moreQuantity` (r `composeQuantity` y) iff (r `inverseComposeQuantity` x) `moreQuantity` y (Galois connection).

inverseComposeRelevance r x returns the most irrelevant y such that forall x, y we have x `moreRelevant` (r `composeRelevance` y) iff (r `inverseComposeRelevance` x) `moreRelevant` y (Galois connection).

morePolarity' x y is True whenever a variable of polarity x can be used anywhere where a variable of polarity y is expected. Note that morePolarity' x y actually means x <= y.

valueprettyHiding :: LensHiding a => a -> (Doc -> Doc) -> Doc -> Doc
#

prettyHiding info visible doc puts the correct braces around doc according to info info and returns visible doc if the we deal with a visible thing.

valuewithArgsFrom :: [a] -> [Arg b] -> [Arg a]
#

xs `withArgsFrom` args translates xs into a list of Args, using the elements in args to fill in the non-unArg fields.

Precondition: The two lists should have equal length.

datadata Access
#

Access modifier.

Constructors

Instances9Eq, Ord, Show, NFData, Pretty, HasRange, …
  • Eq AccessDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Ord AccessDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Show AccessDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • NFData AccessDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Pretty AccessDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • HasRange AccessDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • KillRange AccessDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • MakePrivate AccessDefined in Agda-2.8.0.2 · Agda.Syntax.Concrete.Definitions
  • EmbPrj AccessDefined in Agda-2.8.0.2 · Agda.TypeChecking.Serialise.Instances.Abstract · orphan
datadata Annotation
#

We have a tuple of annotations, which might not be fully orthogonal.

Constructors

  • Annotation
    • annLock :: Lock

      Fitch-style dependent right adjoints. See Modal Dependent Type Theory and Dependent Right Adjoints, arXiv:1804.05236.

Instances11Eq, Ord, Show, Generic, NFData, Null, …
datadata Arg e
#

Constructors

Instances134Functor, Foldable, Traversable, Decoration, IsPrefixOf, MapNamedArgPattern, …
datadata ArgInfo
#

A function argument can be hidden and/or irrelevant.

Constructors

Instances25Eq, Ord, Show, NFData, Null, HasRange, …
datadata Associativity
#
Instances6Eq, Ord, Show, Pretty, ToTerm, EmbPrj
datadata BinderNameOrigin
#
Instances6Eq, Show, Generic, NFData, KillRange, Rep

Positions of variables in syntax declarations.

Constructors

  • BoundVariablePosition
    • holeNumber :: !Int

      The position (in the left-hand side of the syntax declaration) of the hole in which the variable is bound, counting from zero (and excluding parts that are not holes). For instance, for syntax Σ A (λ x → B) = B , A , x the number for x is 1, corresponding to B (0 would correspond to A).

    • varNumber :: !Int

      The position in the list of variables for this particular variable, counting from zero, and including wildcards. For instance, for syntax F (λ x _ y → A) = y ! A ! x the number for x is 0, the number for _ is 1, and the number for y is 2.

Instances5Eq, Ord, Show, NFData, EmbPrj
datadata Catchall
#

Range of the CATCHALL pragma for a clause, if any. Nothing means no such pragma.

Instances10Eq, Show, Generic, Semigroup, Monoid, NFData, …
datadata Cohesion
#

Cohesion modalities see "Brouwer's fixed-point theorem in real-cohesive homotopy type theory" (arXiv:1509.07584) types are now given an additional topological layer which the modalities interact with.

Constructors

  • Flat

    same points, discrete topology, idempotent comonad, box-like.

  • Continuous

    identity modality. | Sharp -- ^ same points, codiscrete topology, idempotent monad, diamond-like.

  • Squash

    single point space, artificially added for Flat left-composition.

Instances26Bounded, Enum, Eq, Ord, Show, Generic, …
datadata ConOrigin
#

Where does the ConP or Con come from?

Constructors

  • ConOSystem

    Inserted by system or expanded from an implicit pattern.

  • ConOCon

    User wrote a constructor (pattern).

  • ConORec

    User wrote a record (pattern).

  • ConOSplit

    Generated by interactive case splitting.

Instances10Bounded, Enum, Eq, Ord, Show, Generic, …

Distinguish constructors from pattern synonyms.

Instances8Bounded, Enum, Show, Generic, NFData, Pretty, …
classclass CopatternMatchingAllowed a where
#

Can we construct a record by copattern matching?

Instances5CopatternMatchingAllowed
datadata CoverageCheck
#

Coverage check? (Default is yes).

Instances11Bounded, Enum, Eq, Ord, Show, Generic, …
datadata Cubical
#

Variants of Cubical Agda.

Instances6Eq, Show, Generic, NFData, EmbPrj, Rep
datadata DisplayLHS
#

Distinguish parsing a DISPLAY pragma from an ordinary left hand side.

Instances8Bounded, Enum, Eq, Show, Generic, Boolean, …
datadata Erased
#

A special case of Quantity: erased or not.

Note that the Ord instance does *not* ignore the origin arguments.

Instances12Eq, Ord, Show, Generic, NFData, Pretty, …
datadata ExpandedEllipsis
#
Instances8Eq, Show, Semigroup, Monoid, NFData, Null, …
datadata FileType
#
Instances8Eq, Ord, Show, Generic, NFData, Pretty, …
datadata Fixity
#

Fixity of operators.

Constructors

Instances11Eq, Ord, Show, NFData, Pretty, Null, …
  • Eq FixityDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Ord FixityDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Show FixityDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • NFData FixityDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Pretty FixityDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Null FixityDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • HasRange FixityDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • KillRange FixityDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • LensFixity FixityDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • ToTerm FixityDefined in Agda-2.8.0.2 · Agda.TypeChecking.Primitive
  • EmbPrj FixityDefined in Agda-2.8.0.2 · Agda.TypeChecking.Serialise.Instances.Common · orphan
datadata Fixity'
#

The notation is handled as the fixity in the renamer. Hence, they are grouped together in this type.

Constructors

Instances12Eq, Show, NFData, Pretty, Null, KillRange, …
datadata FixityLevel
#

Constructors

Instances8Eq, Ord, Show, NFData, Pretty, Null, …
datadata FreeVariables
#
Instances9Eq, Ord, Show, Semigroup, Monoid, NFData, …

Pattern and copattern matching is allowed in the presence of eta.

In the absence of eta, we have to choose whether we want to allow matching on the constructor or copattern matching with the projections. Having both leads to breakage of subject reduction (issue #4560).

datadata HasEta' a
#

Does a record come with eta-equality?

Constructors

Instances12Functor, Foldable, Traversable, CopatternMatchingAllowed, PatternMatchingAllowed, Eq, …
datadata Hiding
#
Instances15Eq, Ord, Show, Semigroup, Monoid, NFData, …
datadata ImportDirective' n m
#

The things you are allowed to say when you shuffle names between name spaces (i.e. in import, namespace, or open declarations).

Constructors

Instances10Eq, Show, Semigroup, Monoid, NFData, Pretty, …
datadata ImportedName' n m
#

An imported name can be a module or a defined name.

Constructors

Instances11PrettyTCM, Eq, Ord, Show, NFData, Pretty, …
newtypenewtype InteractionId
#
Instances18Enum, Eq, Integral, Num, Ord, Read, …
datadata IsAbstract
#

Abstract or concrete.

Instances15Eq, Ord, Show, Generic, Semigroup, Monoid, …
datadata IsInfix
#

Functions can be defined in both infix and prefix style. See LHS.

Instances3Eq, Ord, Show
  • Eq IsInfixDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Ord IsInfixDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Show IsInfixDefined in Agda-2.8.0.2 · Agda.Syntax.Common
datadata IsInstance
#

Is this definition eligible for instance search?

Constructors

Instances7Eq, Ord, Show, NFData, HasRange, KillRange, …
datadata IsMacro
#

Is this a macro definition?

Instances8Eq, Ord, Show, Generic, NFData, HasRange, …
datadata IsOpaque
#

Opaque or transparent.

Constructors

Instances10Eq, Ord, Show, Generic, NFData, KillRange, …
datadata Language
#

Agda variants.

Only some variants are tracked.

Instances7Eq, Show, Generic, NFData, KillRange, EmbPrj, …
classclass LensArgInfo a where
#

Methods

Instances6LensArgInfo
classclass LensCohesion a where
#

A lens to access the Cohesion attribute in data structures. Minimal implementation: getCohesion and mapCohesion or LensModality.

Methods

Instances6LensCohesion
classclass LensFixity a where
#

Methods

Instances7LensFixity, …
classclass LensFreeVariables a where
#

A lens to access the FreeVariables attribute in data structures. Minimal implementation: getFreeVariables and mapFreeVariables or LensArgInfo.

Instances4LensFreeVariables
classclass LensHiding a where
#

A lens to access the Hiding attribute in data structures. Minimal implementation: getHiding and mapHiding or LensArgInfo.

Methods

Instances12LensHiding, …
classclass LensModalPolarity a where
#

A lens to access the PolarityModality attribute in data structures. Minimal implementation: getModalPolarity and mapModalPolarity or LensModality.

Instances9LensModalPolarity, …
classclass LensModality a where
#

Methods

Instances12LensModality, …
classclass LensOrigin a where
#

A lens to access the Origin attribute in data structures. Minimal implementation: getOrigin and mapOrigin or LensArgInfo.

Methods

Instances9LensOrigin, …
classclass LensQuantity a where
#

Methods

Instances12LensQuantity, …
classclass LensRelevance a where
#

A lens to access the Relevance attribute in data structures. Minimal implementation: getRelevance and mapRelevance or LensModality.

Methods

Instances13LensRelevance, …
datadata Lock
#

Constructors

Instances10Eq, Ord, Show, Generic, NFData, Pretty, …
datadata LockOrigin
#

Constructors

Instances7Bounded, Enum, Eq, Ord, Show, Generic, …
datadata MaybePlaceholder e
#

Placeholders are used to represent the underscores in a section.

Constructors

Instances11Functor, Foldable, Traversable, Eq, Ord, Show, …
datadata MetaId
#

Meta-variable identifiers use the same structure as NameIds.

Instances28Enum, Eq, Ord, Show, Generic, NFData, …
datadata ModalPolarity
#

The different polarity options

Constructors

Instances12Bounded, Enum, Eq, Ord, Show, Generic, …
datadata Modality
#

We have a tuple of modalities, which might not be fully orthogonal. For example, irrelevant stuff is also run-time irrelevant.

Constructors

  • Modality
    • modRelevance :: Relevance

      Legacy irrelevance. See Pfenning, LiCS 2001; Abel, Vezzosi and Winterhalter, ICFP 2017.

    • modQuantity :: Quantity

      Cardinality / runtime erasure. See Conor McBride, I got plenty o' nutting, Wadlerfest 2016. See Bob Atkey, Syntax and Semantics of Quantitative Type Theory, LiCS 2018.

    • modCohesion :: Cohesion

      Cohesion/what was in Agda-flat. see "Brouwer's fixed-point theorem in real-cohesive homotopy type theory" (arXiv:1509.07584) Currently only the comonad is implemented.

    • modPolarity :: PolarityModality

      Polarity annotations (strictly positive, ...)

Instances32Eq, Ord, Show, Generic, NFData, Pretty, …
datadata NameId
#

The unique identifier of a name. Second argument is the top-level module identifier.

Instances14Enum, Eq, Ord, Show, Generic, NFData, …
familytype family NameOf a
#

The type of the name

Instances4NameOf
  • type NameOf (Arg a) = NameOf aDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • type NameOf (Named name a) = nameDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • type NameOf (Dom' t e) = NamedNameDefined in Agda-2.8.0.2 · Agda.Syntax.Internal
  • type NameOf (Maybe a) = aDefined in Agda-2.8.0.2 · Agda.Syntax.Common
datadata Named name a
#

Something potentially carrying a name.

Constructors

Instances76MapNamedArgPattern, PatternLike, Functor, Foldable, Traversable, Pretty, …
typetype Nat = Int
#

Number >= 0.

datadata NotationPart
#

Notation parts.

Constructors

  • IdPart RString

    An identifier part. For instance, for _+_ the only identifier part is +.

  • HolePart Range (NamedArg (Ranged Int))

    A hole: a place where argument expressions can be written. For instance, for _+_ the two underscores are holes, and for syntax Σ A (λ x → B) = B , A , x the variables A and B are holes. The number is the position of the hole, counting from zero. For instance, the number for A is 0, and the number for B is 1.

  • VarPart Range (Ranged BoundVariablePosition)

    A bound variable.

    The first range is the range of the variable in the right-hand side of the syntax declaration, and the second range is the range of the variable in the left-hand side.

  • WildPart (Ranged BoundVariablePosition)

    A wildcard (an underscore in binding position).

Instances9Eq, Ord, Show, NFData, Pretty, HasRange, …
datadata OpaqueId
#

The unique identifier of an opaque block. Second argument is the top-level module identifier.

Instances12Enum, Eq, Ord, Show, Generic, NFData, …
datadata Origin
#

Origin of arguments.

Constructors

  • UserWritten

    From the source file / user input. (Preserve!)

  • Inserted

    E.g. inserted hidden arguments.

  • Reflected

    Produced by the reflection machinery.

  • CaseSplit

    Produced by an interactive case split.

  • Substitution

    Named application produced to represent a substitution. E.g. "?0 (x = n)" instead of "?0 n"

  • ExpandedPun

    An expanded hidden argument pun.

  • Generalization

    Inserted by the generalization process

Instances9Eq, Ord, Show, NFData, HasRange, LensOrigin, …
  • Eq OriginDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Ord OriginDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Show OriginDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • NFData OriginDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • HasRange OriginDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • LensOrigin OriginDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • KillRange OriginDefined in Agda-2.8.0.2 · Agda.Syntax.Common
  • ChooseFlex OriginDefined in Agda-2.8.0.2 · Agda.TypeChecking.Rules.LHS.Problem
  • EmbPrj OriginDefined in Agda-2.8.0.2 · Agda.TypeChecking.Serialise.Instances.Common · orphan
datadata OriginIrrelevant
#

Origin of Irrelevant.

Constructors

Instances12Show, Generic, Semigroup, Monoid, NFData, Pretty, …
datadata OriginRelevant
#

Origin of Relevant.

Constructors

Instances12Show, Generic, Semigroup, Monoid, NFData, Pretty, …

Origin of ShapeIrrelevant.

Constructors

Instances12Show, Generic, Semigroup, Monoid, NFData, Pretty, …
datadata OverlapMode
#

The possible overlap modes for an instance, also used for instance candidates.

Constructors

  • Overlappable

    User-written OVERLAPPABLE pragma: this candidate can *be removed* by a more specific candidate.

  • Overlapping

    User-written OVERLAPPING pragma: this candidate can *remove* a less specific candidate.

  • Overlaps

    User-written OVERLAPS pragma: both overlappable and overlapping.

  • DefaultOverlap

    No user-written overlap pragma. This instance can be overlapped by an OVERLAPPING instance, and it can overlap OVERLAPPABLE instances.

  • Incoherent

    User-written INCOHERENT pragma: both overlappable and overlapping; and, if there are multiple candidates after all overlap has been handled, make an arbitrary choice.

  • FieldOverlap

    Overlapping instances in record fields.

Instances10Bounded, Enum, Eq, Ord, Show, NFData, …
datadata Overlappable
#
Instances6Eq, Ord, Show, Semigroup, Monoid, NFData
classclass PatternMatchingAllowed a where
#

Can we pattern match on the record constructor?

Instances5PatternMatchingAllowed
datadata PatternOrCopattern
#

For a record without eta, which type of matching do we allow?

Constructors

Instances17Bounded, Enum, Eq, Ord, Show, NFData, …
datadata PolarityModality
#

Constructors

Instances26Bounded, Eq, Ord, Show, Generic, NFData, …
datadata PositionInName
#

The position of a name part or underscore in a name.

Constructors

  • Beginning

    The following underscore is at the beginning of the name: _foo.

  • Middle

    The following underscore is in the middle of the name: foo_bar.

  • End

    The following underscore is at the end of the name: foo_.

Instances3Eq, Ord, Show
datadata PositivityCheck
#

Positivity check? (Default = True).

Instances11Bounded, Enum, Eq, Ord, Show, Generic, …
newtypenewtype ProblemId
#

A "problem" consists of a set of constraints and the same constraint can be part of multiple problems.

Constructors

Instances15Enum, Eq, Integral, Num, Ord, Real, …
datadata ProjOrigin
#

Where does a projection come from?

Constructors

Instances10Bounded, Enum, Eq, Ord, Show, Generic, …
datadata Q0Origin
#

Origin of Quantity0.

Constructors

Instances14Eq, Ord, Show, Generic, Semigroup, Monoid, …
datadata Q1Origin
#

Origin of Quantity1.

Constructors

Instances14Eq, Ord, Show, Generic, Semigroup, Monoid, …
datadata Quantity
#

Quantity for linearity.

A quantity is a set of natural numbers, indicating possible semantic uses of a variable. A singleton set {n} requires that the corresponding variable is used exactly n times.

Constructors

Instances27Eq, Ord, Show, Generic, NFData, Pretty, …
datadata QωOrigin
#

Origin of Quantityω.

Constructors

Instances14Eq, Ord, Show, Generic, Semigroup, Monoid, …
datadata Ranged a
#

Thing with range info.

Constructors

Instances45Functor, Foldable, Traversable, Decoration, MapNamedArgPattern, Eq, …
datadata RecordDirectives' a
#
Instances14Functor, Foldable, Traversable, ToConcrete, Hilite, DeclaredNames, …
  • Functor RecordDirectives'Defined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Foldable RecordDirectives'Defined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Traversable RecordDirectives'Defined in Agda-2.8.0.2 · Agda.Syntax.Common
  • ToConcrete RecordDirectivesDefined in Agda-2.8.0.2 · Agda.Syntax.Translation.AbstractToConcrete
  • Hilite RecordDirectivesDefined in Agda-2.8.0.2 · Agda.Interaction.Highlighting.FromAbstract

    Reengineered from the old Geniplate-implemented highlighting extraction. This was the old procedure:

    Traversal over declaration in abstract syntax that collects the following hiliting information:

    1. constructorInfo (highest prio)

    2.

    theRest

    (medium prio) 3.

    nameInfo

    (lowest prio)

    nameInfo: "All names mentioned in the syntax tree (not bound variables)." For each possibly ambiguous name (QName and AmbiguousQName) that not isExtendedLambdaName, do hiliteAmbiguous (used to be calledgenerate).

    constructorInfo (only when highlighting level == Full): "After the code has been type checked more information may be available for overloaded constructors, and generateConstructorInfo takes advantage of this information. Note, however, that highlighting for overloaded constructors is included also in nameInfo." This is not computed by recursion over the abstract syntax, but gets the constructor names stDisambiguatedNames that fall within the bounds of the current declaration.

    theRest: Bound variables, dotted patterns, record fields, module names, the "as" and "to" symbols and some other things.

    Here is a table what theRest used to collect:

    • -------------------------------------------------------------------- | A.Expr

    • -------------------------------------------------------------------- | getVarAndField (Expr) | A.Var | bound | getVarAndField | A.Rec(Update) | field | getExpr (Expr) | A.PatternSyn | patsyn | getExpr | A.Macro | macro

    • -------------------------------------------------------------------- | A.LetBinding

    • -------------------------------------------------------------------- | getLet | A.LetBind | bound

    • -------------------------------------------------------------------- | A.LamBinding

    • -------------------------------------------------------------------- | getLam | A.Binder under A.DomainFree | bound | getTyped | A.Binder under A.TBind | bound

    • -------------------------------------------------------------------- | A.Pattern'

    • -------------------------------------------------------------------- | getPattern(Syn) | A.VarP | bound | getPattern(Syn) | A.AsP | bound | getPattern(Syn) | A.DotP (not isProjP) | DottedPattern | getPattern(Syn) | A.RecP | field | getPattern(Syn) | A.PatternSynP | patsyn

    • -------------------------------------------------------------------- | A.Declaration

    • -------------------------------------------------------------------- | getFieldDecl | A.Field under A.RecDef | field | getPatSynArgs | A.PatternSynDef | bound | getPragma | A.BuiltinPragma... | keyword

    • -------------------------------------------------------------------- | A.NamedArg (polymorphism not supported in geniplate)

    • -------------------------------------------------------------------- | getNamedArg | NamedArg a | nameOf | getNamedArgE | NamedArg Exp | nameOf | getNamedArgP | NamedArg Pattern | nameOf | getNamedArgB | NamedArg BindName | nameOf | getNamedArgL | NamedArg LHSCore | nameOf

    | getModuleName | A.MName | mod | getModuleInfo | ModuleInfo | asName, (range of as,to) | getQuantityAttr | Common.Quantity | Symbol (if range)

  • DeclaredNames RecordDirectivesDefined in Agda-2.8.0.2 · Agda.Syntax.Abstract.Views
  • Eq a => Eq (RecordDirectives' a)Defined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Show a => Show (RecordDirectives' a)Defined in Agda-2.8.0.2 · Agda.Syntax.Common
  • NFData a => NFData (RecordDirectives' a)Defined in Agda-2.8.0.2 · Agda.Syntax.Common
  • Null a => Null (RecordDirectives' a)Defined in Agda-2.8.0.2 · Agda.Syntax.Common
  • HasRange a => HasRange (RecordDirectives' a)Defined in Agda-2.8.0.2 · Agda.Syntax.Common
  • KillRange a => KillRange (RecordDirectives' a)Defined in Agda-2.8.0.2 · Agda.Syntax.Common
  • EmbPrj a => EmbPrj (RecordDirectives' a)Defined in Agda-2.8.0.2 · Agda.TypeChecking.Serialise.Instances.Common · orphan
  • type ConOfAbs RecordDirectives = [RecordDirective]Defined in Agda-2.8.0.2 · Agda.Syntax.Translation.AbstractToConcrete
datadata Relevance
#

A function argument can be relevant or irrelevant. See Agda.TypeChecking.Irrelevance.

Constructors

Instances26Eq, Ord, Show, Generic, NFData, Pretty, …
datadata Renaming' n m
#

Constructors

Instances7Eq, Show, NFData, Pretty, HasRange, Hilite, …
datadata RewriteEqn' qn nm p e
#

RewriteEqn' qn p e represents the rewrite and irrefutable with clauses of the LHS. qn stands for the QName of the auxiliary function generated to implement the feature nm is the type of names for pattern variables p is the type of patterns e is the type of expressions

Constructors

Instances19Functor, Foldable, Traversable, Eq, Show, NFData, …
datadata TerminationCheck m
#

Termination check? (Default = TerminationCheck).

Constructors

Instances5Functor, Eq, Show, NFData, KillRange
newtypenewtype UnderAddition t
#

Type wrapper to indicate additive monoid/semigroup context.

Constructors

Instances26Functor, Applicative, Eq, Ord, Show, Semigroup, …
newtypenewtype UnderComposition t
#

Type wrapper to indicate composition or multiplicative monoid/semigroup context.

Constructors

Instances32Functor, Applicative, Eq, Ord, Show, Semigroup, …
datadata UniverseCheck
#

Universe check? (Default is yes).

Instances9Bounded, Enum, Eq, Ord, Show, Generic, …
datadata Using' n m
#

The using clause of import directive.

Constructors

Instances10Eq, Show, Semigroup, Monoid, NFData, Pretty, …
datadata WithHiding a
#

Decorating something with Hiding information.

Constructors

Instances30Functor, Applicative, Foldable, Traversable, Decoration, Eq, …
datadata WithOrigin a
#

Decorating something with Origin information.

Constructors

Instances36Functor, Foldable, Traversable, Decoration, MapNamedArgPattern, Eq, …
datadata Induction
#
Instances9Eq, Ord, Show, NFData, Pretty, HasRange, …

Orphan instances

3 instances