Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity identifier (like ∀, α, ∧, or ♠, for example). It is therefore necessary to have spaces between most lexical units. Many mathematical symbols can be typed using the corresponding LaTeX [https://en.wikipedia let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings

Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity identifier (like ∀, α, ∧, or ♠, for example). It is therefore necessary to have spaces between most lexical units. Many mathematical symbols can be typed using the corresponding LaTeX [https://en.wikipedia let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings

Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity identifier (like ∀, α, ∧, or ♠, for example). It is therefore necessary to have spaces between most lexical units. Many mathematical symbols can be typed using the corresponding LaTeX [https://en.wikipedia let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings

Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity Abstraction Pattern matching lambda Local Definitions: let and where let-expressions where-blocks Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings in aux (pred n) where pred : Nat → Nat pred zero = zero pred (suc m) = m Lexical Structure Agda code is written in UTF-8 encoded plain text files with the extension .agda. Most unicode

Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Lossy Unification Mixfix Operators Module System Mutual Recursion Pattern identifier (like α, ∧, or ♠, for example). It is therefore necessary to have spaces between most lexical units. For example 3∷2∷1∷[] is a valid identifier, so we need to write 3 ∷ 2 ∷ 1 ∷ [] instead to let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings

Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity identifier (like α, ∧, or ♠, for example). It is therefore necessary to have spaces between most lexical units. For example 3∷2∷1∷[] is a valid identifier, so we need to write 3 ∷ 2 ∷ 1 ∷ [] instead to let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings

Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity identifier (like ∀, α, ∧, or ♠, for example). It is therefore necessary to have spaces between most lexical units. Many mathematical symbols can be typed using the corresponding LaTeX [https://en.wikipedia and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings

Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity identifier (like ∀, α, ∧, or ♠, for example). It is therefore necessary to have spaces between most lexical units. Many mathematical symbols can be typed using the corresponding LaTeX [https://en.wikipedia and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings

Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms Positivity identifier (like α, ∧, or ♠, for example). It is therefore necessary to have spaces between most lexical units. For example 3∷2∷1∷[] is a valid identifier, so we need to write 3 ∷ 2 ∷ 1 ∷ [] instead to let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings

Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Lossy Unification Mixfix Operators Module System Mutual Recursion Pattern identifier (like α, ∧, or ♠, for example). It is therefore necessary to have spaces between most lexical units. For example 3∷2∷1∷[] is a valid identifier, so we need to write 3 ∷ 2 ∷ 1 ∷ [] instead to let and where let-expressions where-blocks Proving properties More Examples (for Beginners) Lexical Structure Tokens Layout Literate Agda Literal Overloading Natural numbers Negative numbers Strings