It is not the case that Type theory interprets proofs as programs, but classical tautologies like (P∨¬P) don't yield computable functions without additional axioms.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.