I don't know anything about homotopy types, but I think that they are trying to build a system in which automated proofs can be computed more easily. So the appeal is for applying computer methods for proofs. Also it…
In example 2.2, to distinguish between an element and a function a better example is to consider a constant such as 7 can be an element of R or a constant function. With type theory notation, 1:R versus \x:R.1, another…
I don't know anything about homotopy types, but I think that they are trying to build a system in which automated proofs can be computed more easily. So the appeal is for applying computer methods for proofs. Also it…
In example 2.2, to distinguish between an element and a function a better example is to consider a constant such as 7 can be an element of R or a constant function. With type theory notation, 1:R versus \x:R.1, another…