reservedid → case | class | data | default | deriving | do | else | foreign | if | import | in | infix | infixl | infixr | instance | let | module | newtype | of | then | type | where | _ An identifier prefix negation, all operators are infix, although each infix operator can be used in a section to yield partially applied operators (see Section 3.5). All of the standard infix operators are just predefined letters, and the others by identifiers beginning with capitals; also, variables and constructors have infix forms, the other four do not. Module names are a dot-separated sequence of conids. Namespaces are

module Agda.Builtin.Equality The identity type can be bound to the built-in EQUALITY as follows infix 4 _≡_ data _≡_ {a} {A : Set a} (x : A) : A → Set a where refl : x ≡ x {-# BUILTIN EQUALITY _≡_ BUILTIN INTERVAL I #-} -- I : Setω {-# BUILTIN IZERO i0 #-} {-# BUILTIN IONE i1 #-} infix 30 primINeg infixr 20 primIMin primIMax primitive primIMin : I → I → I -- _∧_ primIMax : I → postulate PathP : ∀ {ℓ} (A : I → Set ℓ) → A i0 → A i1 → Set ℓ {-# BUILTIN PATHP PathP #-} infix 4 _≡_ _≡_ : ∀ {ℓ} {A : Set ℓ} → A → A → Set ℓ _≡_ {A = A} = PathP (λ _ → A) {-# BUILTIN PATH

module Agda.Builtin.Equality The identity type can be bound to the built-in EQUALITY as follows infix 4 _≡_ data _≡_ {a} {A : Set a} (x : A) : A → Set a where refl : x ≡ x {-# BUILTIN EQUALITY _≡_ BUILTIN INTERVAL I #-} -- I : Setω {-# BUILTIN IZERO i0 #-} {-# BUILTIN IONE i1 #-} infix 30 primINeg infixr 20 primIMin primIMax primitive primIMin : I → I → I -- _∧_ primIMax : I → postulate PathP : ∀ {ℓ} (A : I → Set ℓ) → A i0 → A i1 → Set ℓ {-# BUILTIN PATHP PathP #-} infix 4 _≡_ _≡_ : ∀ {ℓ} {A : Set ℓ} → A → A → Set ℓ _≡_ {A = A} = PathP (λ _ → A) {-# BUILTIN PATH

Agda displays the term (x + y) + z as x + y + z (without parenthesis). This is done because of the infix statement infixl 6 _+_ that was declared in the imported Agda.Builtin.Nat module. This declaration module Agda.Builtin.Equality The identity type can be bound to the built-in EQUALITY as follows infix 4 _≡_ data _≡_ {a} {A : Set a} (x : A) : A → Set a where refl : x ≡ x {-# BUILTIN EQUALITY _≡_ translation from Agda.Syntax.Concrete to Agda.Syntax.Abstract involves scope analysis, figuring out infix operator precedences and tidying up definitions. The abstract syntax Agda.Syntax.Abstract is the

Agda displays the term (x + y) + z as x + y + z (without parenthesis). This is done because of the infix statement infixl 6 _+_ that was declared in the imported Agda.Builtin.Nat module. This declaration module Agda.Builtin.Equality The identity type can be bound to the built-in EQUALITY as follows infix 4 _≡_ data _≡_ {a} {A : Set a} (x : A) : A → Set a where refl : x ≡ x {-# BUILTIN EQUALITY _≡_ translation from Agda.Syntax.Concrete to Agda.Syntax.Abstract involves scope analysis, figuring out infix operator precedences and tidying up definitions. The abstract syntax Agda.Syntax.Abstract is the

Agda displays the term (x + y) + z as x + y + z (without parenthesis). This is done because of the infix statement infixl 6 _+_ that was declared in the imported Agda.Builtin.Nat module. This declaration module Agda.Builtin.Equality The identity type can be bound to the built-in EQUALITY as follows infix 4 _≡_ data _≡_ {a} {A : Set a} (x : A) : A → Set a where refl : x ≡ x {-# BUILTIN EQUALITY _≡_ translation from Agda.Syntax.Concrete to Agda.Syntax.Abstract involves scope analysis, figuring out infix operator precedences and tidying up definitions. The abstract syntax Agda.Syntax.Abstract is the

Agda displays the term (x + y) + z as x + y + z (without parenthesis). This is done because of the infix statement infixl 6 _+_ that was declared in the imported Agda.Builtin.Nat module. This declaration module Agda.Builtin.Equality The identity type can be bound to the built-in EQUALITY as follows infix 4 _≡_ data _≡_ {a} {A : Set a} (x : A) : A → Set a where refl : x ≡ x {-# BUILTIN EQUALITY _≡_ translation from Agda.Syntax.Concrete to Agda.Syntax.Abstract involves scope analysis, figuring out infix operator precedences and tidying up definitions. The abstract syntax Agda.Syntax.Abstract is the

Agda displays the term (x + y) + z as x + y + z (without parenthesis). This is done because of the infix statement infixl 6 _+_ that was declared in the imported Agda.Builtin.Nat module. This declaration : Z → Z -Z (p , n) = (n , p) _≡Z_ : (x y : Z) → Set (p , n) ≡Z (p' , n') = (p + n') ≡ (p' + n) infix 10 _≡Z_ private postulate +comm : ∀ n m → (n + m) ≡ (m + n) invZ : ∀ x → (x +Z (-Z x)) ≡Z 0Z invZ module Agda.Builtin.Equality The identity type can be bound to the built-in EQUALITY as follows infix 4 _≡_ data _≡_ {a} {A : Set a} (x : A) : A → Set a where refl : x ≡ x {-# BUILTIN EQUALITY _≡_ #-}

Agda displays the term (x + y) + z as x + y + z (without parenthesis). This is done because of the infix statement infixl 6 _+_ that was declared in the imported Agda.Builtin.Nat module. This declaration : Z → Z -Z (p , n) = (n , p) _≡Z_ : (x y : Z) → Set (p , n) ≡Z (p' , n') = (p + n') ≡ (p' + n) infix 10 _≡Z_ private postulate +comm : ∀ n m → (n + m) ≡ (m + n) invZ : ∀ x → (x +Z (-Z x)) ≡Z 0Z invZ module Agda.Builtin.Equality The identity type can be bound to the built-in EQUALITY as follows infix 4 _≡_ data _≡_ {a} {A : Set a} (x : A) : A → Set a where refl : x ≡ x {-# BUILTIN EQUALITY _≡_ #-}

Agda displays the term (x + y) + z as x + y + z (without parenthesis). This is done because of the infix statement infixl 6 _+_ that was declared in the imported Agda.Builtin.Nat module. This declaration : Z → Z -Z (p , n) = (n , p) _≡Z_ : (x y : Z) → Set (p , n) ≡Z (p' , n') = (p + n') ≡ (p' + n) infix 10 _≡Z_ private postulate +comm : ∀ n m → (n + m) ≡ (m + n) invZ : ∀ x → (x +Z (-Z x)) ≡Z 0Z invZ module Agda.Builtin.Equality The identity type can be bound to the built-in EQUALITY as follows infix 4 _≡_ data _≡_ {a} {A : Set a} (x : A) : A → Set a where refl : x ≡ x {-# BUILTIN EQUALITY _≡_ #-}