Agda-like programming in Coq/P...

How to Notify the Agda Type-Ch...

How do I prove pseudo-associat...

Defining operations on HITs...

Agda: Parse error when proving...

Agda: prove that ¬Any≃All...

use that an argument has a cer...

Unsafe coerce and more efficie...

Agda termination checking fail...

Non-tedious AST transformation...

Can a dependently typed langua...

How to create a list of elemen...

Failed to solve constraints: (...

Inductive relations: Explicit ...

Agda mode not converting unico...

Agda allows for incorrect proo...

Agda: Why does the compiler de...

Agda: Could not parse the appl...

Agda error: Importing module I...

Agda error: Not in scope when ...

How to prove that equal functi...

How can I prove dependent func...

stuck on a proof (modeling IMP...

Agda proving Bool ≢ ⊤...

Why can some disjoint and exha...

Agda Recursion on Proof...

Agda Unresolved Metas...

Lexicographic ordering of pair...

Cubical Agda Inclusion Order...

How to deal with non-terminati...