in various ways, e.g. as difference of two natural numbers: module Integer where abstract = Nat × Nat 0 : 0 = 0 , 0 1 : 1 = 1 , 0 _+_ : (x y : ) → (p , n) + (p' , n') = (p + p') , (n + n') -_ : they can see through the abstractions of their uncles: module Where where abstract x : Nat x = 0 y : Nat y = x where xy : x 0 xy = refl Type signatures in where blocks are private, so it is fine in where blocks of abstract definitions: module WherePrivate where abstract x : Nat x = proj1 t where T = Nat × Nat t : T t = 0 , 1 p : proj1 t 0 p = refl Note that if p was not private, application

in various ways, e.g. as difference of two natural numbers: module Integer where abstract = Nat × Nat 0 : 0 = 0 , 0 1 : 1 = 1 , 0 _+_ : (x y : ) → (p , n) + (p' , n') = (p + p') , (n + n') -_ : they can see through the abstractions of their uncles: module Where where abstract x : Nat x = 0 y : Nat y = x where xy : x 0 xy = refl Type signatures in where blocks are private, so it is fine in where blocks of abstract definitions: module WherePrivate where abstract x : Nat x = proj1 t where T = Nat × Nat t : T t = 0 , 1 p : proj1 t 0 p = refl Note that if p was not private, application

in various ways, e.g. as difference of two natural numbers: module Integer where abstract = Nat × Nat 0 : 0 = 0 , 0 1 : 1 = 1 , 0 _+_ : (x y : ) → (p , n) + (p' , n') = (p + p') , (n + n') -_ : they can see through the abstractions of their uncles: module Where where abstract x : Nat x = 0 y : Nat y = x where xy : x 0 xy = refl Type signatures in where blocks are private, so it is fine in where blocks of abstract definitions: module WherePrivate where abstract x : Nat x = proj1 t where T = Nat × Nat t : T t = 0 , 1 p : proj1 t 0 p = refl Note that if p was not private, application

can define the type Vec n of vectors of length n. This is a family of types indexed by objects in Nat (a type parameterized by natural numbers). Having dependent types, we must generalize the type of matrix, is then a function of type identity : (n : Nat) -> (Mat n n). Remark: We could, of course, just specify the identity function with the type Nat -> Nat -> Mat, where Mat is the type of matrices, but arithmetical operations 6 Chapter 2. Getting Started Agda User Manual, Release 2.6.1.2 • the type (n : Nat) -> (PrimRoot n) consisting of functions computing primitive root in modular arithmetic. Of course

can define the type Vec n of vectors of length n. This is a family of types indexed by objects in Nat (a type parameterized by natural numbers). Having dependent types, we must generalize the type of matrix, is then a function of type identity : (n : Nat) -> (Mat n n). Remark: We could, of course, just specify the identity function with the type Nat -> Nat -> Mat, where Mat is the type of matrices, but arithmetical operations 6 Chapter 2. Getting Started Agda User Manual, Release 2.6.1 • the type (n : Nat) -> (PrimRoot n) consisting of functions computing primitive root in modular arithmetic. Of course

can define the type Vec n of vectors of length n. This is a family of types indexed by objects in Nat (a type parameterized by natural numbers). Having dependent types, we must generalize the type of matrix, is then a function of type identity : (n : Nat) -> (Mat n n). Remark: We could, of course, just specify the identity function with the type Nat -> Nat -> Mat, where Mat is the type of matrices, but arithmetical operations 6 Chapter 2. Getting Started Agda User Manual, Release 2.6.1.1 • the type (n : Nat) -> (PrimRoot n) consisting of functions computing primitive root in modular arithmetic. Of course

can define the type Vec n of vectors of length n. This is a family of types indexed by objects in Nat (a type parameterized by natural numbers). Having dependent types, we must generalize the type of matrix, is then a function of type identity : (n : Nat) -> (Mat n n). Remark: We could, of course, just specify the identity function with the type Nat -> Nat -> Mat, where Mat is the type of matrices, but arithmetical operations 6 Chapter 2. Getting Started Agda User Manual, Release 2.6.1.3 • the type (n : Nat) -> (PrimRoot n) consisting of functions computing primitive root in modular arithmetic. Of course

in various ways, e.g. as difference of two natural numbers: module Integer where abstract = Nat × Nat 0 : 0 = 0 , 0 1 : 1 = 1 , 0 _+_ : (x y : ) → (p , n) + (p' , n') = (p + p') , (n + n') -_ : they can see through the abstractions of their uncles: module Where where abstract x : Nat x = 0 y : Nat y = x where xy : x 0 xy = refl Type signatures in where blocks are private, so it is fine in where blocks of abstract definitions: module WherePrivate where abstract x : Nat x = proj1 t where T = Nat × Nat t : T t = 0 , 1 p : proj1 t 0 p = refl Note that if p was not private, application

can define the type Vec n of vectors of length n. This is a family of types indexed by objects in Nat (a type parameterized by natural numbers). Having dependent types, we must generalize the type of matrix is then a function of type identity : (n : Nat) -> (Mat n n). Remark: We could of course just specify the identity function with the type Nat -> Nat -> Mat, where Mat is the type of matrices; but to define • equality on natural numbers • properties of arithmetical operations • the type (n : Nat) -> (PrimRoot n) consisting of functions computing primitive root in modular arithmetic. Of course

can define the type Vec n of vectors of length n. This is a family of types indexed by objects in Nat (a type parameterized by natural numbers). Having dependent types, we must generalize the type of matrix is then a function of type identity : (n : Nat) -> (Mat n n). Remark: We could of course just specify the identity function with the type Nat -> Nat -> Mat, where Mat is the type of matrices; but to define • equality on natural numbers • properties of arithmetical operations • the type (n : Nat) -> (PrimRoot n) consisting of functions computing primitive root in modular arithmetic. Of course