. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 3.24 Lossy Unification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122 of the datatype being matched on. • For each constructor c that does not appear in a clause, unification of the indices of the type of the constructor with the indices of the datatype should end in a the pattern x :: xs is Vec A (suc n), which is unifiable with the type Vec A (suc m). Meanwhile, unification of the type Vec A 0 of the constructor [] with the type Vec A (suc n) results in a conflict between

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 3.24 Lossy Unification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122 of the datatype being matched on. • For each constructor c that does not appear in a clause, unification of the indices of the type of the constructor with the indices of the datatype should end in a the pattern x :: xs is Vec A (suc n), which is unifiable with the type Vec A (suc m). Meanwhile, unification of the type Vec A 0 of the constructor [] with the type Vec A (suc n) results in a conflict between

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 3.24 Lossy Unification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122 of the datatype being matched on. • For each constructor c that does not appear in a clause, unification of the indices of the type of the constructor with the indices of the datatype should end in a the pattern x :: xs is Vec A (suc n), which is unifiable with the type Vec A (suc m). Meanwhile, unification of the type Vec A 0 of the constructor [] with the type Vec A (suc n) results in a conflict between

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 3.24 Lossy Unification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123 of the datatype being matched on. • For each constructor c that does not appear in a clause, unification of the indices of the type of the constructor with the indices of the datatype should end in a the pattern x :: xs is Vec A (suc n), which is unifiable with the type Vec A (suc m). Meanwhile, unification of the type Vec A 0 of the constructor [] with the type Vec A (suc n) results in a conflict between

Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Lossy Unification Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Interaction Modalities Guarded Cubical References Implicit Arguments Tactic arguments Metavariables Unification Instance Arguments Usage Instance resolution Irrelevance Motivating example Irrelevant function Literate Agda Literal Overloading Natural numbers Negative numbers Strings Restrictions Lossy Unification Heuristic Example Drawbacks Mixfix Operators Precedence Associativity Ambiguity and Scope Operators

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 3.24 Lossy Unification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123 of the datatype being matched on. • For each constructor c that does not appear in a clause, unification of the indices of the type of the constructor with the indices of the datatype should end in a the pattern x :: xs is Vec A (suc n), which is unifiable with the type Vec A (suc m). Meanwhile, unification of the type Vec A 0 of the constructor [] with the type Vec A (suc n) results in a conflict between

Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Lossy Unification Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Interaction Modalities Guarded Cubical References Implicit Arguments Tactic arguments Metavariables Unification Instance Arguments Usage Instance resolution Irrelevance Motivating example Irrelevant function Literate Agda Literal Overloading Natural numbers Negative numbers Strings Restrictions Lossy Unification Heuristic Example Drawbacks Mixfix Operators Precedence Associativity Ambiguity and Scope Operators

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 3.23 Lossy Unification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109 of the datatype being matched on. • For each constructor c that does not appear in a clause, unification of the indices of the type of the constructor with the indices of the datatype should end in a pattern x :: xs is Vec A (suc n), which is unifiable with the type Vec A (suc m). Mean- while, unification of the type Vec A 0 of the constructor [] with the type Vec A (suc n) results in a conflict between

Interaction Modalities Guarded Cubical References Implicit Arguments Tactic arguments Metavariables Unification Instance Arguments Usage Instance resolution Irrelevance Motivating example Irrelevant function indices of the datatype being matched on. For each constructor c that does not appear in a clause, unification of the indices of the type of the constructor with the indices of the datatype should end in a the pattern x ∷ xs is Vec A (suc n), which is unifiable with the type Vec A (suc m). Meanwhile, unification of the type Vec A 0 of the constructor [] with the type Vec A (suc n) results in a conflict between

Interaction Modalities Guarded Cubical References Implicit Arguments Tactic arguments Metavariables Unification Instance Arguments Usage Instance resolution Irrelevance Motivating example Irrelevant function indices of the datatype being matched on. For each constructor c that does not appear in a clause, unification of the indices of the type of the constructor with the indices of the datatype should end in a the pattern x ∷ xs is Vec A (suc n), which is unifiable with the type Vec A (suc m). Meanwhile, unification of the type Vec A 0 of the constructor [] with the type Vec A (suc n) results in a conflict between