Interfacing Coq + SSReflect with GAP

Authors:
Vladimir Komendantsky;Alexander Konovalov;Steve Linton
Affiliations:
School of Computer Science, St Andrews University, St Andrews, KY16 9SX, UK;School of Computer Science, St Andrews University, St Andrews, KY16 9SX, UK;School of Computer Science, St Andrews University, St Andrews, KY16 9SX, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2012

Citing 8
Cited 0

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
A Skeptic’s Approach to Combining HOL and Maple

Journal of Automated Reasoning
Type-checking injective pure type systems

Journal of Functional Programming
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
Hints in Unification

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Packaging Mathematical Structures

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Working with mathematical structures in type theory

TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report on an extendable implementation of the communication interface connecting Coq proof assistant to the computational algebra system GAP using the Symbolic Computation Software Composability Protocol (SCSCP). It allows Coq to issue OpenMath requests to a local or remote GAP instances and represent server responses as Coq terms.