Abstract "Anything" Theory & Proof Reuse via DTP
Galois Tech Talk
How abstractions that appear as type classes (e.g. in Haskell) behave when extended with propositions in a dependently typed setting (e.g. in Agda).
Covers dependent records, scoping, equational reasoning, and instance arguments.
Elisp for slides/presentation mode
Put your cursor between a comment block (----
) and use super-n
(for
next slide) and super-p
(for previous slide).
Use the import statements on GTT.agda
as the index.