Views: a way for pattern matching to cohabit with data abstraction
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Typing algorithm in type theory with inheritance
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The GAP 4 type system: organising algebraic algorithms
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Formal and efficient primality proofs by use of computer algebra oracles
Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
Mathematical Knowledge Management in HELM
Annals of Mathematics and Artificial Intelligence
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
Symbolic Computation Software Composability
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
OpenMath in SCIEnce: SCSCP and POPCORN
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Structural Abstract Interpretation: A Formal Study Using Coq
Language Engineering and Rigorous Software Development
Packaging Mathematical Structures
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
A computational approach to pocklington certificates in type theory
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
Data representation is an important aspect of software composition. It is often the case that different software components are programmed to represent data in the ways which are the most appropriate for their problem domains. Sometimes, converting data from one representation to another is a non-trivial task. This is the case with computer algebra systems and type-theory based interactive theorem provers such as Coq. We provide some custom instrumentation inside Coq to support a computer algebra system (CAS) communication protocol known as SCSCP. We describe general aspects of viewing OpenMath terms produced by a CAS in the calculus of Coq, as well as viewing pure Coq terms in a simpler type system that is behind OpenMath.