Well … it isn't quite that simple
ACM SIGSAM Bulletin
Multiple-valued complex functions and computer algebra
ACM SIGSAM Bulletin
NIST Digital Library of Mathematical Functions
Annals of Mathematics and Artificial Intelligence
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
IMPS: An Interactive Mathematical Proof System
Proceedings of the 10th International Conference on Automated Deduction
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Modelling general recursion in type theory
Mathematical Structures in Computer Science
Certified Computer Algebra on Top of an Interactive Theorem Prover
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Partial recursive functions in higher-order logic
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions they tend not to explicitly write the side conditions. We present an approach to formalizing partiality in real and complex analysis in total frameworks that allows keeping the side conditions hidden from the user as long as they can be computed and simplified automatically. This framework simplifies defining and operating on partial functions in formalized real analysis in HOL Light. Our framework allows simplifying expressions under partiality conditions in a proof assistant in a manner that resembles computer algebra systems.