AGDAPATTERN and AGDACLAUSE built-ins respectively. Types are simply terms. Terms and patterns use de Bruijn indices to represent variables. data Term : Set data Sort : Set data Pattern : Set data Clause : Pattern proj : (f : Name) → Pattern absurd : (x : Nat) → Pattern -- Absurd patterns have de Bruijn indices data Clause where clause : (tel : Telescope) (ps : List (Arg Pattern)) (t : correct-by-construction type checker for simply typed λ-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: infixr 6 _=>_ data Type : Set

AGDAPATTERN and AGDACLAUSE built-ins respectively. Types are simply terms. Terms and patterns use de Bruijn indices to represent variables. data Term : Set data Sort : Set data Pattern : Set data Clause : Pattern proj : (f : Name) → Pattern absurd : (x : Nat) → Pattern -- Absurd patterns have de Bruijn indices data Clause where clause : (tel : Telescope) (ps : List (Arg Pattern)) (t : correct-by-construction type checker for simply typed λ-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: infixr 6 _=>_ data Type : Set

AGDAPATTERN and AGDACLAUSE built-ins respectively. Types are simply terms. Terms and patterns use de Bruijn indices to represent variables. data Term : Set data Sort : Set data Pattern : Set data Clause : Pattern proj : (f : Name) → Pattern absurd : (x : Nat) → Pattern -- Absurd patterns have de Bruijn indices data Clause where clause : (tel : Telescope) (ps : List (Arg Pattern)) (t : correct-by-construction type checker for simply typed λ-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: infixr 6 _=>_ data Type : Set

AGDAPATTERN and AGDACLAUSE built-ins respectively. Types are simply terms. Terms and patterns use de Bruijn 138 Chapter 3. Language Reference Agda User Manual, Release 2.6.2 indices to represent variables Literal) → Pattern proj : (f : Name) → Pattern absurd : (x : Nat) → Pattern -- Absurd patterns have de Bruijn indices data Clause where clause : (tel : Telescope) (ps : List (Arg Pattern)) (t : Term) → Clause correct-by-construction type checker for simply typed ?-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: 3.38. Syntactic Sugar 161 Agda

AGDAPATTERN and AGDACLAUSE built-ins respectively. Types are simply terms. Terms and patterns use de Bruijn indices to represent variables. data Term : Set data Sort : Set data Pattern : Set data Clause : Literal) → Pattern proj : (f : Name) → Pattern absurd : (x : Nat) → Pattern -- Absurd patterns have de Bruijn indices data Clause where clause : (tel : Telescope) (ps : List (Arg Pattern)) (t : Term) → Clause correct-by-construction type checker for simply typed ?-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: infixr 6 _=>_ data Type : Set

AGDAPATTERN and AGDACLAUSE built-ins respectively. Types are simply terms. Terms and patterns use de Bruijn 138 Chapter 3. Language Reference Agda User Manual, Release 2.6.2.1 indices to represent variables Literal) → Pattern proj : (f : Name) → Pattern absurd : (x : Nat) → Pattern -- Absurd patterns have de Bruijn indices data Clause where clause : (tel : Telescope) (ps : List (Arg Pattern)) (t : Term) → Clause correct-by-construction type checker for simply typed ?-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: 3.38. Syntactic Sugar 161 Agda

AGDAPATTERN and AGDACLAUSE built-ins respectively. Types are simply terms. Terms and patterns use de Bruijn indices to represent variables. data Term : Set data Sort : Set data Pattern : Set data Clause : Pattern proj : (f : Name) → Pattern absurd : (x : Nat) → Pattern -- Absurd patterns have de Bruijn indices data Clause where clause : (tel : Telescope) (ps : List (Arg Pattern)) (t : correct-by-construction type checker for simply typed λ-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: infixr 6 _=>_ data Type : Set

the AGDATERM, AGDASORT and AGDACLAUSE built-ins respectively. Types are simply terms. Terms use de Bruijn indices to represent variables. data Term : Set data Sort : Set data Clause : Set Type = Term data correct-by-construction type checker for simply typed λ-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: infixr 6 _=>_ data Type : Set

the AGDATERM, AGDASORT and AGDACLAUSE built- ins respectively. Types are simply terms. Terms use de Bruijn indices to represent variables. data Term : Set data Sort : Set data Clause : Set Type = Term data correct-by-construction type checker for simply typed ?-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: infixr 6 _=>_ data Type : Set

the AGDATERM, AGDASORT and AGDACLAUSE built- ins respectively. Types are simply terms. Terms use de Bruijn indices to represent variables. data Term : Set data Sort : Set data Clause : Set Type = Term data correct-by-construction type checker for simply typed ?-calculus. First we define the raw terms, using de Bruijn indices for variables and explicit type annotations on the lambda: infixr 6 _=>_ data Type : Set