Open Internet by MindsNet

Scalability limits of dependent type systems in ITPs

The manual labor required to create valid proof terms in interactive proof assistants (ITPs) based on dependent type theory is a significant bottleneck. This process scales horribly and is a major problem. The labor-intensive nature of guiding a proof assistant through mathematical spaces limits the efficiency of ITPs.

Computing & Technology, Computer Science, Programming Languages