I'm a few chapters into "Programming Language Foundations in Agda" and... I'm still struggling to figure out how to write proofs in it, more than I did when learning Rocq or Isabelle or Lean. Granted, I have been very tired for months, but I'm wondering if it's more than that.
Is Agda somehow trickier to write proofs in? Does PLFA introduce techniques in a way that doesn't match what people do in practice? Do I just have a skill issue here?