I’d like to announce a result that might be interesting: an interpreter for a very small dependent type system in Coq, assuming uniqueness of identity proofs (UIP). Because it assumes UIP, it’s not immediately compatible with HoTT, but it seems … Continue reading A Formalized Interpreter
Copy and paste this URL into your WordPress site to embed
Copy and paste this code into your site to embed