Search
Now showing items 1-1 of 1
A Logical Relation for Dependent Type Theory Formalized in Agda
(2017-02-27)
When writing proofs, it is desirable to show that one’s proof is correct. With
formalising a proof in dependent type theory, it is implied that the proof is correct
as long as the type theory is correct. <br><br> This ...