论文信息 - Interfacing Coq + SSReflect with GAP

Interfacing Coq + SSReflect with GAP

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.

Steve Linton | Alexander Konovalov | Vladimir Komendantsky

[1] John Harrison,et al. A Skeptic's Approach to Combining HOL and Maple , 1998, Journal of Automated Reasoning.

[2] Assia Mahboubi,et al. Packaging Mathematical Structures , 2009, TPHOLs.

[3] Sidi Ould Biha. Finite Groups Representation Theory with Coq , 2009, Calculemus/MKM.

[4] Steve Linton,et al. Symbolic Computation Software Composability , 2008, AISC/MKM/Calculemus.

[5] Claudio Sacerdoti Coen,et al. Working with Mathematical Structures in Type Theory , 2007, TYPES.

[6] Amokrane Saïbi. Typing algorithm in type theory with inheritance , 1997, POPL '97.

[7] Andrea Asperti,et al. Hints in Unification , 2009, TPHOLs.

[8] Luca Padovani,et al. HELM and the Semantic Math-Web , 2001, TPHOLs.

[9] Thomas Breuer,et al. The GAP 4 type system: organising algebraic algorithms , 1998, ISSAC '98.

[10] John Harrison,et al. Reasoning About the Reals: The Marriage of HOL and Maple , 1993, LPAR.

[11] Gilles Barthe,et al. Type-checking injective pure type systems , 1999, Journal of Functional Programming.