Structure Literal Overloading Lossy Unification Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Run-time Irrelevance on it. To do so, put the cursor inside the hole and press C-c C-c. Agda asks for the name of the pattern variable to case on. Let’s write x and press return. This replaces the previous clause with two new x) y z = { }1 Important The x in the type signature of +-assoc-proof is not the same as the x pattern variable in the last clause where suc x is written. The following would also work: +-assoc-proof

Structure Literal Overloading Lossy Unification Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Run-time Irrelevance on it. To do so, put the cursor inside the hole and press C-c C-c. Agda asks for the name of the pattern variable to case on. Let’s write x and press return. This replaces the previous clause with two new x) y z = { }1 Important The x in the type signature of +-assoc-proof is not the same as the x pattern variable in the last clause where suc x is written. The following would also work: +-assoc-proof

and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Run-time Irrelevance on it. To do so, put the cursor inside the hole and press C-c C-c. Agda asks for the name of the pattern variable to case on. Let’s write x and press return. This replaces the previous clause with two new x) y z = { }1 Important The x in the type signature of +-assoc-proof is not the same as the x pattern variable in the last clause where suc x is written. The following would also work: +-assoc-proof

and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Run-time Irrelevance on it. To do so, put the cursor inside the hole and press C-c C-c. Agda asks for the name of the pattern variable to case on. Let’s write x and press return. This replaces the previous clause with two new x) y z = { }1 Important The x in the type signature of +-assoc-proof is not the same as the x pattern variable in the last clause where suc x is written. The following would also work: +-assoc-proof

and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Run-time hole which denotes the right hand side of a definition, then this command automatically performs pattern matching on variables of your choice. C-c C-n Normalise. The system asks for a term which is then Types Simple datatypes Parametrized datatypes Indexed datatypes Strict positivity Flat Modality Pattern Matching on @♭ Foreign Function Interface Compiler Pragmas Haskell FFI JavaScript FFI Function

and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Run-time hole which denotes the right hand side of a definition, then this command automatically performs pattern matching on variables of your choice. C-c C-n Normalise. The system asks for a term which is then Types Simple datatypes Parametrized datatypes Indexed datatypes Strict positivity Flat Modality Pattern Matching on @♭ Foreign Function Interface Compiler Pragmas Haskell FFI JavaScript FFI Function

and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Run-time hole which denotes the right hand side of a definition, then this command automatically performs pattern matching on variables of your choice. C-c C-n Normalise. The system asks for a term which is then Types Simple datatypes Parametrized datatypes Indexed datatypes Strict positivity Flat Modality Pattern Matching on @♭ Foreign Function Interface Compiler Pragmas Haskell FFI JavaScript FFI Function

and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Run-time hole which denotes the right hand side of a definition, then this command automatically performs pattern matching on variables of your choice. C-c C-n Normalise. The system asks for a term which is then Types Simple datatypes Parametrized datatypes Indexed datatypes Strict positivity Flat Modality Pattern Matching on @♭ Foreign Function Interface Compiler Pragmas Haskell FFI JavaScript FFI Function

and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Safe Agda hole which denotes the right hand side of a definition, then this command automatically performs pattern matching on variables of your choice. C-c C-n Normalise. The system asks for a term which is then record fields Dependent irrelevant function types Irrelevant instance arguments Lambda Abstraction Pattern matching lambda Local Definitions: let and where let-expressions where-blocks Proving properties

and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Safe Agda hole which denotes the right hand side of a definition, then this command automatically performs pattern matching on variables of your choice. C-c C-n Normalise. The system asks for a term which is then record fields Dependent irrelevant function types Irrelevant instance arguments Lambda Abstraction Pattern matching lambda Local Definitions: let and where let-expressions where-blocks Proving properties