Titlebook: Intelligent Computer Mathematics; 10th International C Herman Geuvers,Matthew England,Olaf Teschke Conference proceedings 2017 Springer Int

彈藥

Automatically Proving Equivalence by Type-Safe Reflection,d. For example, implementing an adder for binary numbers indexed over their natural number equivalents naturally leads to proof obligations for equalities of expressions over natural numbers. The need for these equality proofs comes, in intensional type theories, from the fact that the propositional