Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Program generalization for software reuse: from C to C++
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Patching Proofs for Reuse (Extended Abstract)
ECML '95 Proceedings of the 8th European Conference on Machine Learning
Generalization and Reuse of Tactic Proofs
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Type Isomorphisms and Proof Reuse in Dependent Type Theory
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Reuse of Proofs in Software Verification
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
A Certified Version of Buchberger's Algorithm
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A model of analogy-driven proof-plan construction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A computational view of implicit coercions in type theory
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
This paper describes a mechanism to generalize mathematical results in type theory based proof assistants. The proposed mechanism starts from a proved theorem or a proved set of theorems (a theory) and makes it possible to get less specific results that can be instantiated and reused in other contexts.