| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Agda.Syntax.Concrete
Contents
Description
The concrete syntax is a raw representation of the program text without any desugaring at all. This is what the parser produces. The idea is that if we figure out how to keep the concrete syntax around, it can be printed exactly as the user wrote it.
Synopsis
- data Expr
- = Ident QName
- | Lit Range Literal
- | QuestionMark Range (Maybe Nat)
- | Underscore Range (Maybe String)
- | RawApp Range (List2 Expr)
- | App Range Expr (NamedArg Expr)
- | OpApp Range QName (Set Name) OpAppArgs
- | WithApp Range Expr [Expr]
- | HiddenArg Range (Named_ Expr)
- | InstanceArg Range (Named_ Expr)
- | Lam Range (List1 LamBinding) Expr
- | AbsurdLam Range Hiding
- | ExtendedLam Range Erased (List1 LamClause)
- | Fun Range (Arg Expr) Expr
- | Pi Telescope1 Expr
- | Rec Range RecordAssignments
- | RecUpdate Range Expr [FieldAssignment]
- | Let Range (List1 Declaration) (Maybe Expr)
- | Paren Range Expr
- | IdiomBrackets Range [Expr]
- | DoBlock Range (List1 DoStmt)
- | Absurd Range
- | As Range Name Expr
- | Dot Range Expr
- | DoubleDot Range Expr
- | Quote Range
- | QuoteTerm Range
- | Tactic Range Expr
- | Unquote Range
- | DontCare Expr
- | Equal Range Expr Expr
- | Ellipsis Range
- | KnownIdent NameKind QName
- | KnownOpApp NameKind Range QName (Set Name) OpAppArgs
- | Generalized Expr
- data OpApp e
- = SyntaxBindingLambda Range (List1 LamBinding) e
- | Ordinary e
- fromOrdinary :: e -> OpApp e -> e
- type OpAppArgs = OpAppArgs' Expr
- type OpAppArgs' e = [NamedArg (MaybePlaceholder (OpApp e))]
- module Agda.Syntax.Concrete.Name
- data AppView = AppView Expr [NamedArg Expr]
- appView :: Expr -> AppView
- unAppView :: AppView -> Expr
- rawApp :: List1 Expr -> Expr
- rawAppP :: List1 Pattern -> Pattern
- isSingleIdentifierP :: Pattern -> Maybe Name
- removeParenP :: Pattern -> Pattern
- isPattern :: Expr -> Maybe Pattern
- isAbsurdP :: Pattern -> Maybe (Range, Hiding)
- isBinderP :: Pattern -> Maybe Binder
- observeHiding :: Expr -> WithHiding Expr
- observeRelevance :: Expr -> (Relevance, Expr)
- observeModifiers :: Expr -> Arg Expr
- exprToPatternWithHoles :: Expr -> Pattern
- returnExpr :: Expr -> Maybe Expr
- data Binder' a = Binder {
- binderPattern :: Maybe Pattern
- binderName :: a
- type Binder = Binder' BoundName
- mkBinder_ :: Name -> Binder
- mkBinder :: a -> Binder' a
- type LamBinding = LamBinding' TypedBinding
- data LamBinding' a
- = DomainFree (NamedArg Binder)
- | DomainFull a
- dropTypeAndModality :: LamBinding -> [LamBinding]
- type TypedBinding = TypedBinding' Expr
- data TypedBinding' e
- type RecordAssignment = Either FieldAssignment ModuleAssignment
- type RecordAssignments = [RecordAssignment]
- type FieldAssignment = FieldAssignment' Expr
- data FieldAssignment' a = FieldAssignment {
- _nameFieldA :: Name
- _exprFieldA :: a
- nameFieldA :: Lens' (FieldAssignment' a) Name
- exprFieldA :: Lens' (FieldAssignment' a) a
- data ModuleAssignment = ModuleAssignment {}
- data BoundName = BName {}
- mkBoundName_ :: Name -> BoundName
- mkBoundName :: Name -> Fixity' -> BoundName
- type TacticAttribute = Maybe (Ranged Expr)
- type Telescope = [TypedBinding]
- type Telescope1 = List1 TypedBinding
- lamBindingsToTelescope :: Range -> [LamBinding] -> Telescope
- makePi :: Telescope -> Expr -> Expr
- mkLam :: Range -> [LamBinding] -> Expr -> Expr
- mkLet :: Range -> [Declaration] -> Expr -> Expr
- mkTLet :: Range -> [Declaration] -> Maybe (TypedBinding' e)
- data Declaration
- = TypeSig ArgInfo TacticAttribute Name Expr
- | FieldSig IsInstance TacticAttribute Name (Arg Expr)
- | Generalize Range [TypeSignature]
- | Field Range [FieldSignature]
- | FunClause LHS RHS WhereClause Bool
- | DataSig Range Erased Name [LamBinding] Expr
- | Data Range Erased Name [LamBinding] Expr [TypeSignatureOrInstanceBlock]
- | DataDef Range Name [LamBinding] [TypeSignatureOrInstanceBlock]
- | RecordSig Range Erased Name [LamBinding] Expr
- | RecordDef Range Name RecordDirectives [LamBinding] [Declaration]
- | Record Range Erased Name RecordDirectives [LamBinding] Expr [Declaration]
- | RecordDirective RecordDirective
- | Infix Fixity (List1 Name)
- | Syntax Name Notation
- | PatternSyn Range Name [Arg Name] Pattern
- | Mutual Range [Declaration]
- | InterleavedMutual Range [Declaration]
- | Abstract Range [Declaration]
- | Private Range Origin [Declaration]
- | InstanceB Range [Declaration]
- | LoneConstructor Range [Declaration]
- | Macro Range [Declaration]
- | Postulate Range [TypeSignatureOrInstanceBlock]
- | Primitive Range [TypeSignature]
- | Open Range QName ImportDirective
- | Import Range QName (Maybe AsName) !OpenShortHand ImportDirective
- | ModuleMacro Range Erased Name ModuleApplication !OpenShortHand ImportDirective
- | Module Range Erased QName Telescope [Declaration]
- | UnquoteDecl Range [Name] Expr
- | UnquoteDef Range [Name] Expr
- | UnquoteData Range Name [Name] Expr
- | Pragma Pragma
- | Opaque Range [Declaration]
- | Unfolding Range [QName]
- isPragma :: CMaybe Pragma m => Declaration -> m
- isRecordDirective :: Declaration -> Maybe RecordDirective
- data RecordDirective
- type RecordDirectives = RecordDirectives' (Name, IsInstance)
- data ModuleApplication
- type TypeSignature = Declaration
- type TypeSignatureOrInstanceBlock = Declaration
- type ImportDirective = ImportDirective' Name Name
- type Using = Using' Name Name
- type ImportedName = ImportedName' Name Name
- type Renaming = Renaming' Name Name
- type RenamingDirective = RenamingDirective' Name Name
- type HidingDirective = HidingDirective' Name Name
- data AsName' a = AsName {}
- type AsName = AsName' (Either Expr Name)
- data OpenShortHand
- type RewriteEqn = RewriteEqn' () Name Pattern Expr
- type WithExpr = Named Name (Arg Expr)
- data LHS = LHS {}
- data Pattern
- = IdentP Bool QName
- | QuoteP Range
- | AppP Pattern (NamedArg Pattern)
- | RawAppP Range (List2 Pattern)
- | OpAppP Range QName (Set Name) [NamedArg Pattern]
- | HiddenP Range (Named_ Pattern)
- | InstanceP Range (Named_ Pattern)
- | ParenP Range Pattern
- | WildP Range
- | AbsurdP Range
- | AsP Range Name Pattern
- | DotP Range Expr
- | LitP Range Literal
- | RecP Range [FieldAssignment' Pattern]
- | EqualP Range [(Expr, Expr)]
- | EllipsisP Range (Maybe Pattern)
- | WithP Range Pattern
- data LHSCore
- = LHSHead {
- lhsDefName :: QName
- lhsPats :: [NamedArg Pattern]
- | LHSProj { }
- | LHSWith { }
- | LHSEllipsis { }
- = LHSHead {
- data LamClause = LamClause {}
- type RHS = RHS' Expr
- data RHS' e
- type WhereClause = WhereClause' [Declaration]
- data WhereClause' decls
- data ExprWhere = ExprWhere Expr WhereClause
- data DoStmt
- data Pragma
- = OptionsPragma Range [String]
- | BuiltinPragma Range RString QName
- | RewritePragma Range Range [QName]
- | ForeignPragma Range RString String
- | CompilePragma Range RString QName String
- | StaticPragma Range QName
- | InlinePragma Range Bool QName
- | ImpossiblePragma Range [String]
- | EtaPragma Range QName
- | WarningOnUsage Range QName Text
- | WarningOnImport Range Text
- | InjectivePragma Range QName
- | DisplayPragma Range Pattern Expr
- | CatchallPragma Range
- | TerminationCheckPragma Range (TerminationCheck Name)
- | NoCoverageCheckPragma Range
- | NoPositivityCheckPragma Range
- | PolarityPragma Range Name [Occurrence]
- | NoUniverseCheckPragma Range
- | NotProjectionLikePragma Range QName
- data Module = Mod {
- modPragmas :: [Pragma]
- modDecls :: [Declaration]
- data ThingWithFixity x = ThingWithFixity x Fixity'
- type HoleContent = HoleContent' () Name Pattern Expr
- data HoleContent' qn nm p e
- = HoleContentExpr e
- | HoleContentRewrite [RewriteEqn' qn nm p e]
- spanAllowedBeforeModule :: [Declaration] -> ([Declaration], [Declaration])
Expressions
Concrete expressions. Should represent exactly what the user wrote.
Constructors
| Ident QName | ex: |
| Lit Range Literal | ex: |
| QuestionMark Range (Maybe Nat) | ex: |
| Underscore Range (Maybe String) | ex: |
| RawApp Range (List2 Expr) | before parsing operators |
| App Range Expr (NamedArg Expr) | ex: |
| OpApp Range QName (Set Name) OpAppArgs | ex: |
| WithApp Range Expr [Expr] | ex: |
| HiddenArg Range (Named_ Expr) | ex: |
| InstanceArg Range (Named_ Expr) | ex: |
| Lam Range (List1 LamBinding) Expr | ex: |
| AbsurdLam Range Hiding | ex: |
| ExtendedLam Range Erased (List1 LamClause) | ex: |
| Fun Range (Arg Expr) Expr | ex: |
| Pi Telescope1 Expr | ex: |
| Rec Range RecordAssignments | ex: |
| RecUpdate Range Expr [FieldAssignment] | ex: |
| Let Range (List1 Declaration) (Maybe Expr) | ex: |
| Paren Range Expr | ex: |
| IdiomBrackets Range [Expr] | ex: |
| DoBlock Range (List1 DoStmt) | ex: |
| Absurd Range | ex: |
| As Range Name Expr | ex: |
| Dot Range Expr | ex: |
| DoubleDot Range Expr | ex: |
| Quote Range | ex: |
| QuoteTerm Range | ex: |
| Tactic Range Expr | ex: |
| Unquote Range | ex: |
| DontCare Expr | to print irrelevant things |
| Equal Range Expr Expr | ex: |
| Ellipsis Range |
|
| KnownIdent NameKind QName | An identifier coming from abstract syntax, for which we know a precise syntactic highlighting class (used in printing). |
| KnownOpApp NameKind Range QName (Set Name) OpAppArgs | An operator application coming from abstract syntax, for which we know a precise syntactic highlighting class (used in printing). |
| Generalized Expr |
Instances
Constructors
| SyntaxBindingLambda Range (List1 LamBinding) e | An abstraction inside a special syntax declaration (see Issue 358 why we introduce this). |
| Ordinary e |
Instances
| Foldable OpApp Source # | |
Defined in Agda.Syntax.Concrete Methods fold :: Monoid m => OpApp m -> m # foldMap :: Monoid m => (a -> m) -> OpApp a -> m # foldMap' :: Monoid m => (a -> m) -> OpApp a -> m # foldr :: (a -> b -> b) -> b -> OpApp a -> b # foldr' :: (a -> b -> b) -> b -> OpApp a -> b # foldl :: (b -> a -> b) -> b -> OpApp a -> b # foldl' :: (b -> a -> b) -> b -> OpApp a -> b # foldr1 :: (a -> a -> a) -> OpApp a -> a # foldl1 :: (a -> a -> a) -> OpApp a -> a # elem :: Eq a => a -> OpApp a -> Bool # maximum :: Ord a => OpApp a -> a # minimum :: Ord a => OpApp a -> a # | |
| Traversable OpApp Source # | |
| Functor OpApp Source # | |
| Pretty (OpApp Expr) Source # | |
| ExprLike a => ExprLike (OpApp a) Source # | |
| HasRange e => HasRange (OpApp e) Source # | |
| KillRange e => KillRange (OpApp e) Source # | |
Defined in Agda.Syntax.Concrete Methods killRange :: KillRangeT (OpApp e) Source # | |
| Show a => Show (OpApp a) Source # | |
| NFData a => NFData (OpApp a) Source # | Ranges are not forced. |
Defined in Agda.Syntax.Concrete | |
| Eq e => Eq (OpApp e) Source # | |
fromOrdinary :: e -> OpApp e -> e Source #
type OpAppArgs = OpAppArgs' Expr Source #
type OpAppArgs' e = [NamedArg (MaybePlaceholder (OpApp e))] Source #
module Agda.Syntax.Concrete.Name
removeParenP :: Pattern -> Pattern Source #
isPattern :: Expr -> Maybe Pattern Source #
Turn an expression into a pattern. Fails if the expression is not a valid pattern.
observeHiding :: Expr -> WithHiding Expr Source #
Observe the hiding status of an expression
exprToPatternWithHoles :: Expr -> Pattern Source #
Turn an expression into a pattern, turning non-pattern subexpressions into WildP.
Bindings
A Binder x@p, the pattern is optional
Constructors
| Binder | |
Fields
| |
Instances
type LamBinding = LamBinding' TypedBinding Source #
A lambda binding is either domain free or typed.
data LamBinding' a Source #
Constructors
| DomainFree (NamedArg Binder) | . |
| DomainFull a | . |
Instances
dropTypeAndModality :: LamBinding -> [LamBinding] Source #
Drop type annotations and lets from bindings.
type TypedBinding = TypedBinding' Expr Source #
A typed binding.
data TypedBinding' e Source #
Constructors
| TBind Range (List1 (NamedArg Binder)) e | Binding |
| TLet Range (List1 Declaration) | Let binding |
Instances
type RecordAssignments = [RecordAssignment] Source #
type FieldAssignment = FieldAssignment' Expr Source #
data FieldAssignment' a Source #
Constructors
| FieldAssignment | |
Fields
| |
Instances
nameFieldA :: Lens' (FieldAssignment' a) Name Source #
exprFieldA :: Lens' (FieldAssignment' a) a Source #
data ModuleAssignment Source #
Constructors
| ModuleAssignment | |
Fields
| |
Instances
Constructors
| BName | |
Fields
| |
Instances
| Pretty BoundName Source # | |
| HasRange Binder Source # | |
| HasRange BoundName Source # | |
| KillRange Binder Source # | |
Defined in Agda.Syntax.Concrete Methods | |
| KillRange BoundName Source # | |
Defined in Agda.Syntax.Concrete Methods | |
| Show BoundName Source # | |
| NFData Binder Source # | |
Defined in Agda.Syntax.Concrete | |
| NFData BoundName Source # | |
Defined in Agda.Syntax.Concrete | |
| Eq BoundName Source # | |
| ToAbstract (Binder' (NewName BoundName)) Source # | |
| ToAbstract (NewName BoundName) Source # | |
| type AbsOfCon (Binder' (NewName BoundName)) Source # | |
| type AbsOfCon (NewName BoundName) Source # | |
Defined in Agda.Syntax.Translation.ConcreteToAbstract | |
mkBoundName_ :: Name -> BoundName Source #
type Telescope = [TypedBinding] Source #
type Telescope1 = List1 TypedBinding Source #
A telescope is a sequence of typed bindings. Bound variables are in scope in later types.
lamBindingsToTelescope :: Range -> [LamBinding] -> Telescope Source #
We can try to get a Telescope from a [LamBinding].
If we have a type annotation already, we're happy.
Otherwise we manufacture a binder with an underscore for the type.
makePi :: Telescope -> Expr -> Expr Source #
Smart constructor for Pi: check whether the Telescope is empty
mkLam :: Range -> [LamBinding] -> Expr -> Expr Source #
Smart constructor for Lam: check for non-zero bindings.
mkLet :: Range -> [Declaration] -> Expr -> Expr Source #
Smart constructor for Let: check for non-zero let bindings.
mkTLet :: Range -> [Declaration] -> Maybe (TypedBinding' e) Source #
Smart constructor for TLet: check for non-zero let bindings.
Declarations
data Declaration Source #
The representation type of a declaration. The comments indicate which type in the intended family the constructor targets.
Constructors
Instances
isPragma :: CMaybe Pragma m => Declaration -> m Source #
Return Declaration if Declaration is Declaration.
isRecordDirective :: Declaration -> Maybe RecordDirective Source #
Extract a record directive
data RecordDirective Source #
Isolated record directives parsed as Declarations
Constructors
| Induction (Ranged Induction) | Range of keyword |
| Constructor Name IsInstance | |
| Eta (Ranged HasEta0) | Range of |
| PatternOrCopattern Range | If declaration |
Instances
| HasRange RecordDirective Source # | |
Defined in Agda.Syntax.Concrete Methods getRange :: RecordDirective -> Range Source # | |
| KillRange RecordDirective Source # | |
Defined in Agda.Syntax.Concrete Methods | |
| Show RecordDirective Source # | |
Defined in Agda.Syntax.Concrete Methods showsPrec :: Int -> RecordDirective -> ShowS # show :: RecordDirective -> String # showList :: [RecordDirective] -> ShowS # | |
| NFData RecordDirective Source # | Ranges are not forced. |
Defined in Agda.Syntax.Concrete Methods rnf :: RecordDirective -> () # | |
| Eq RecordDirective Source # | |
Defined in Agda.Syntax.Concrete Methods (==) :: RecordDirective -> RecordDirective -> Bool # (/=) :: RecordDirective -> RecordDirective -> Bool # | |
type RecordDirectives = RecordDirectives' (Name, IsInstance) Source #
data ModuleApplication Source #
Constructors
| SectionApp Range Telescope Expr | tel. M args |
| RecordModuleInstance Range QName | M {{...}} |
Instances
type TypeSignature = Declaration Source #
Just type signatures.
type TypeSignatureOrInstanceBlock = Declaration Source #
Just type signatures or instance blocks.
type ImportDirective = ImportDirective' Name Name Source #
The things you are allowed to say when you shuffle names between name
spaces (i.e. in import, namespace, or open declarations).
type ImportedName = ImportedName' Name Name Source #
An imported name can be a module or a defined name.
type HidingDirective = HidingDirective' Name Name Source #
The content of the as-clause of the import statement.
Constructors
| AsName | |
Instances
| HasRange AsName Source # | |
| KillRange AsName Source # | |
Defined in Agda.Syntax.Concrete Methods | |
| Foldable AsName' Source # | |
Defined in Agda.Syntax.Concrete Methods fold :: Monoid m => AsName' m -> m # foldMap :: Monoid m => (a -> m) -> AsName' a -> m # foldMap' :: Monoid m => (a -> m) -> AsName' a -> m # foldr :: (a -> b -> b) -> b -> AsName' a -> b # foldr' :: (a -> b -> b) -> b -> AsName' a -> b # foldl :: (b -> a -> b) -> b -> AsName' a -> b # foldl' :: (b -> a -> b) -> b -> AsName' a -> b # foldr1 :: (a -> a -> a) -> AsName' a -> a # foldl1 :: (a -> a -> a) -> AsName' a -> a # elem :: Eq a => a -> AsName' a -> Bool # maximum :: Ord a => AsName' a -> a # minimum :: Ord a => AsName' a -> a # | |
| Traversable AsName' Source # | |
| Functor AsName' Source # | |
| NFData AsName Source # | Ranges are not forced. |
Defined in Agda.Syntax.Concrete | |
| Show a => Show (AsName' a) Source # | |
| Eq a => Eq (AsName' a) Source # | |
data OpenShortHand Source #
Instances
| Pretty OpenShortHand Source # | |
Defined in Agda.Syntax.Concrete.Pretty Methods pretty :: OpenShortHand -> Doc Source # prettyPrec :: Int -> OpenShortHand -> Doc Source # prettyList :: [OpenShortHand] -> Doc Source # | |
| Generic OpenShortHand Source # | |
Defined in Agda.Syntax.Concrete Associated Types type Rep OpenShortHand :: Type -> Type # | |
| Show OpenShortHand Source # | |
Defined in Agda.Syntax.Concrete Methods showsPrec :: Int -> OpenShortHand -> ShowS # show :: OpenShortHand -> String # showList :: [OpenShortHand] -> ShowS # | |
| NFData OpenShortHand Source # | |
Defined in Agda.Syntax.Concrete Methods rnf :: OpenShortHand -> () # | |
| Eq OpenShortHand Source # | |
Defined in Agda.Syntax.Concrete Methods (==) :: OpenShortHand -> OpenShortHand -> Bool # (/=) :: OpenShortHand -> OpenShortHand -> Bool # | |
| type Rep OpenShortHand Source # | |
type RewriteEqn = RewriteEqn' () Name Pattern Expr Source #
Left hand sides can be written in infix style. For example:
n + suc m = suc (n + m) (f ∘ g) x = f (g x)
We use fixity information to see which name is actually defined.
Constructors
| LHS | Original pattern (including with-patterns), rewrite equations and with-expressions. |
Fields
| |
Instances
| Pretty LHS Source # | |
| ExprLike LHS Source # | |
| HasEllipsis LHS Source # | Does the lhs contain an ellipsis? |
Defined in Agda.Syntax.Concrete.Pattern Methods hasEllipsis :: LHS -> Bool Source # | |
| HasRange LHS Source # | |
| KillRange LHS Source # | |
Defined in Agda.Syntax.Concrete Methods | |
| Show LHS Source # | |
| NFData LHS Source # | Ranges are not forced. |
Defined in Agda.Syntax.Concrete | |
| Eq LHS Source # | |
Concrete patterns. No literals in patterns at the moment.
Constructors
| IdentP Bool QName |
If the boolean is
|
| QuoteP Range | quote |
| AppP Pattern (NamedArg Pattern) |
|
| RawAppP Range (List2 Pattern) |
|
| OpAppP Range QName (Set Name) [NamedArg Pattern] | eg: |
| HiddenP Range (Named_ Pattern) |
|
| InstanceP Range (Named_ Pattern) |
|
| ParenP Range Pattern | (p) |
| WildP Range | _ |
| AbsurdP Range | () |
| AsP Range Name Pattern |
|
| DotP Range Expr | .e |
| LitP Range Literal |
|
| RecP Range [FieldAssignment' Pattern] | record {x = p; y = q} |
| EqualP Range [(Expr, Expr)] |
|
| EllipsisP Range (Maybe Pattern) |
|
| WithP Range Pattern |
|
Instances
Processed (operator-parsed) intermediate form of the core f ps of LHS.
Corresponds to lhsOriginalPattern.
Constructors
| LHSHead | |
Fields
| |
| LHSProj | |
| LHSWith | |
| LHSEllipsis | |
Fields
| |
Constructors
| LamClause | |
Instances
| Pretty RHS Source # | |
| HasRange RHS Source # | |
| KillRange RHS Source # | |
Defined in Agda.Syntax.Concrete Methods | |
| ToAbstract RHS Source # | |
| Foldable RHS' Source # | |
Defined in Agda.Syntax.Concrete Methods fold :: Monoid m => RHS' m -> m # foldMap :: Monoid m => (a -> m) -> RHS' a -> m # foldMap' :: Monoid m => (a -> m) -> RHS' a -> m # foldr :: (a -> b -> b) -> b -> RHS' a -> b # foldr' :: (a -> b -> b) -> b -> RHS' a -> b # foldl :: (b -> a -> b) -> b -> RHS' a -> b # foldl' :: (b -> a -> b) -> b -> RHS' a -> b # foldr1 :: (a -> a -> a) -> RHS' a -> a # foldl1 :: (a -> a -> a) -> RHS' a -> a # elem :: Eq a => a -> RHS' a -> Bool # maximum :: Ord a => RHS' a -> a # | |
| Traversable RHS' Source # | |
| Functor RHS' Source # | |
| Show RHS Source # | |
| ExprLike a => ExprLike (RHS' a) Source # | |
| NFData a => NFData (RHS' a) Source # | |
Defined in Agda.Syntax.Concrete | |
| Eq e => Eq (RHS' e) Source # | |
| type AbsOfCon RHS Source # | |
Defined in Agda.Syntax.Translation.ConcreteToAbstract | |
type WhereClause = WhereClause' [Declaration] Source #
where block following a clause.
data WhereClause' decls Source #
Constructors
| NoWhere | No |
| AnyWhere Range decls | Ordinary |
| SomeWhere Range Erased Name Access decls | Named where: |
Instances
An expression followed by a where clause. Currently only used to give better a better error message in interaction.
Constructors
| ExprWhere Expr WhereClause |
Constructors
| DoBind Range Pattern Expr [LamClause] | p ← e where cs |
| DoThen Expr | |
| DoLet Range (List1 Declaration) |
Constructors
| OptionsPragma Range [String] | |
| BuiltinPragma Range RString QName | |
| RewritePragma Range Range [QName] | Second Range is for REWRITE keyword. |
| ForeignPragma Range RString String | first string is backend name |
| CompilePragma Range RString QName String | first string is backend name |
| StaticPragma Range QName | |
| InlinePragma Range Bool QName | INLINE or NOINLINE |
| ImpossiblePragma Range [String] | Throws an internal error in the scope checker.
The |
| EtaPragma Range QName | For coinductive records, use pragma instead of regular
|
| WarningOnUsage Range QName Text | Applies to the named function |
| WarningOnImport Range Text | Applies to the current module |
| InjectivePragma Range QName | Mark a definition as injective for the pattern matching unifier. |
| DisplayPragma Range Pattern Expr | Display lhs as rhs (modifies the printer). |
| CatchallPragma Range | Applies to the following function clause. |
| TerminationCheckPragma Range (TerminationCheck Name) | Applies to the following function (and all that are mutually recursive with it) or to the functions in the following mutual block. |
| NoCoverageCheckPragma Range | Applies to the following function (and all that are mutually recursive with it) or to the functions in the following mutual block. |
| NoPositivityCheckPragma Range | Applies to the following data/record type or mutual block. |
| PolarityPragma Range Name [Occurrence] | |
| NoUniverseCheckPragma Range | Applies to the following data/record type. |
| NotProjectionLikePragma Range QName | Applies to the stated function |
Instances
| Pretty Pragma Source # | |
| HasRange Pragma Source # | |
| KillRange Pragma Source # | |
Defined in Agda.Syntax.Concrete Methods | |
| ToAbstract Pragma Source # | |
| Show Pragma Source # | |
| NFData Pragma Source # | Ranges are not forced. |
Defined in Agda.Syntax.Concrete | |
| Eq Pragma Source # | |
| type AbsOfCon Pragma Source # | |
Defined in Agda.Syntax.Translation.ConcreteToAbstract | |
Modules: Top-level pragmas plus other top-level declarations.
Constructors
| Mod | |
Fields
| |
data ThingWithFixity x Source #
Decorating something with Fixity'.
Constructors
| ThingWithFixity x Fixity' |
Instances
type HoleContent = HoleContent' () Name Pattern Expr Source #
data HoleContent' qn nm p e Source #
Extended content of an interaction hole.
Constructors
| HoleContentExpr e | e |
| HoleContentRewrite [RewriteEqn' qn nm p e] | (rewrite | invert) e0 | ... | en |
Instances
| ToAbstract HoleContent Source # | Content of interaction hole. |
Defined in Agda.Syntax.Translation.ConcreteToAbstract Associated Types type AbsOfCon HoleContent Source # Methods toAbstract :: HoleContent -> ScopeM (AbsOfCon HoleContent) Source # | |
| Foldable (HoleContent' qn nm p) Source # | |
Defined in Agda.Syntax.Concrete Methods fold :: Monoid m => HoleContent' qn nm p m -> m # foldMap :: Monoid m => (a -> m) -> HoleContent' qn nm p a -> m # foldMap' :: Monoid m => (a -> m) -> HoleContent' qn nm p a -> m # foldr :: (a -> b -> b) -> b -> HoleContent' qn nm p a -> b # foldr' :: (a -> b -> b) -> b -> HoleContent' qn nm p a -> b # foldl :: (b -> a -> b) -> b -> HoleContent' qn nm p a -> b # foldl' :: (b -> a -> b) -> b -> HoleContent' qn nm p a -> b # foldr1 :: (a -> a -> a) -> HoleContent' qn nm p a -> a # foldl1 :: (a -> a -> a) -> HoleContent' qn nm p a -> a # toList :: HoleContent' qn nm p a -> [a] # null :: HoleContent' qn nm p a -> Bool # length :: HoleContent' qn nm p a -> Int # elem :: Eq a => a -> HoleContent' qn nm p a -> Bool # maximum :: Ord a => HoleContent' qn nm p a -> a # minimum :: Ord a => HoleContent' qn nm p a -> a # sum :: Num a => HoleContent' qn nm p a -> a # product :: Num a => HoleContent' qn nm p a -> a # | |
| Traversable (HoleContent' qn nm p) Source # | |
Defined in Agda.Syntax.Concrete Methods traverse :: Applicative f => (a -> f b) -> HoleContent' qn nm p a -> f (HoleContent' qn nm p b) # sequenceA :: Applicative f => HoleContent' qn nm p (f a) -> f (HoleContent' qn nm p a) # mapM :: Monad m => (a -> m b) -> HoleContent' qn nm p a -> m (HoleContent' qn nm p b) # sequence :: Monad m => HoleContent' qn nm p (m a) -> m (HoleContent' qn nm p a) # | |
| Functor (HoleContent' qn nm p) Source # | |
Defined in Agda.Syntax.Concrete Methods fmap :: (a -> b) -> HoleContent' qn nm p a -> HoleContent' qn nm p b # (<$) :: a -> HoleContent' qn nm p b -> HoleContent' qn nm p a # | |
| type AbsOfCon HoleContent Source # | |
Defined in Agda.Syntax.Translation.ConcreteToAbstract | |
spanAllowedBeforeModule :: [Declaration] -> ([Declaration], [Declaration]) Source #
Splits off allowed (= import) declarations before the first non-allowed declaration. After successful parsing, the first non-allowed declaration should be a module declaration.