Why is chain of equational reasoning failing to meet trivially solvable constraints?...

In Agda, how to prove properties about matched patterns in with-abstractions?...

How to write a type signature with two parameters?...

Do we have an easy way to see elaborated core terms in agda?...

Defining the head of a list with a proof object...

Should I add src/MAlonzo to .gitignore?...

Configuration file for command-line options...

Auto solve implicit arguments by a function in Agda?...

Proving a type is a Functor - Inference error?...

Decidable equality of data types in Agda...

Parametric theorem implied by goal...

Why does Agda require pattern matching here...

List Set should be a sort, but it isn't...

Why is my definition not allowed because of strict positivity?...

Can I prove "coinductive principles" about coinductive type?...

Is flattening a list easier in dependently typed functional programming languages?...

How to define observational equality in Agda...

How to break long lines in Agda...

Substitute terms in Agda proofs...

How to declare axioms in Agda?...

A definition for finite sets in Agda...

Why won't the following Agda code typecheck?...

Increment binary value type by one...

Can I safely assume that isomorphic types are equal?...

Agda – difference between type args on the left and right side of the colon...

Agda not eliminating clause in goal despite pattern matching on it...

Proving inversion lemma for subtyping, termination checking, `subst`...

What are the general forms for type ascription in Agda?...

Termination checking failed to prove ∃-even′ : ∀ {n : ℕ} → ∃[ m ] ( 2 * m ≡ n) → even n...

Agda: How usual/curly braces are used relative to each other and to ':' sign...