Alignment-based Translations Across Formal Systems Using Interface Theories

Translating expressions between different logics and theorem provers is notoriously and often prohibitively difficult, due to the large differences between the logical foundations, the implementations of the systems, and the structure of the respective libraries. Practical solutions for exchanging theorems across theorem provers have remained both weak and brittle. Consequently, libraries are not easily reusable across systems, and substantial effort must be spent on reformalizing and proving basic results in each system. Notably, this problem exists already if we only try to exchange theorem statements and forgo exchanging proofs. In previous work we introduced alignments as a lightweight standard for relating concepts across libraries and conjectured that it would provide a good base for translating expressions. In this paper, we demonstrate the feasibility of this approach. We use a foundationally uncommitted framework to write interface theories that abstract from logical foundation, implementation, and library structure. Then we use alignments to record how the concepts in the interface theories are realized in several major proof assistant libraries, and we use that information to translate expressions across libraries. Concretely, we present exemplary interface theories for several areas of mathematics and - in total - several hundred alignments that were found manually.

[1]  Michael Kohlhase,et al.  A scalable module system , 2011, Inf. Comput..

[2]  Thibault Gauthier,et al.  Matching Concepts across HOL Libraries , 2014, CICM.

[3]  Michael Kohlhase,et al.  QED Reloaded: Towards a Pluralistic Formal Library of Mathematical Knowledge , 2016, J. Formaliz. Reason..

[4]  Claudio Sacerdoti Coen,et al.  A Foundational View on Integration Problems , 2011, Calculemus/MKM.

[5]  Alexander Krauss,et al.  A Mechanized Translation from Higher-Order Logic to Set Theory , 2010, ITP.

[6]  Toby Walsh,et al.  Automated Deduction—CADE-11 , 1992, Lecture Notes in Computer Science.

[7]  Florian Rabe,et al.  How to identify, translate and combine logics? , 2017, J. Log. Comput..

[8]  Michael Kohlhase,et al.  Mathematical Models as Research Data via Flexiformal Theory Graphs , 2017, CICM.

[9]  Andrzej Trybulec,et al.  Computer Assisted Reasoning with MIZAR , 1985, IJCAI.

[10]  Michael Kohlhase,et al.  MathDox : mathematical documents on the web , 2006 .

[11]  Steven Obua,et al.  Importing HOL into Isabelle/HOL , 2006, IJCAR.

[12]  Stephen M. Watt,et al.  Intelligent Computer Mathematics , 2014, Lecture Notes in Computer Science.

[13]  Olivier Hermant,et al.  The λΠ-calculus Modulo as a Universal Proof Language , 2012, PxTP.

[14]  Thibault Gauthier,et al.  Classification of Alignments Between Concepts of Formal Mathematical Systems , 2017, CICM.

[15]  Florian Rabe,et al.  A Query Language for Formal Mathematical Libraries , 2012, AISC/MKM/Calculemus.

[16]  Michael Kohlhase,et al.  OMDoc - An Open Markup Format for Mathematical Documents [version 1.2] , 2006, Lecture Notes in Computer Science.

[17]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[18]  Benjamin Werner,et al.  Importing HOL Light into Coq , 2010, ITP.

[19]  Cezary Kaliszyk,et al.  Towards Knowledge Management for HOL Light , 2014, CICM.

[20]  Michael Kohlhase,et al.  Translating the Mizar Mathematical Library into OMDoc format , 2011 .

[21]  Jacques Carette,et al.  Realms: A Structure for Consolidating Knowledge about Mathematical Theories , 2014, CICM.

[22]  Josef Urban,et al.  Intelligent Computer Mathematics - 18th Symposium, Calculemus 2011, and 10th International Conference, MKM 2011, Bertinoro, Italy, July 18-23, 2011. Proceedings , 2011, Calculemus/MKM.

[23]  Michael Kohlhase,et al.  Understanding Mathematical Theory Formation via Theory Intersections in Mmt , 2015 .

[24]  Michael Kohlhase,et al.  Making PVS Accessible to Generic Services by Interpretation in a Universal Format , 2017, ITP.

[25]  Natarajan Shankar,et al.  PVS: A Prototype Verification System , 1992, CADE.

[26]  Michael Kohlhase,et al.  Interoperability in the OpenDreamKit Project: The Math-in-the-Middle Approach , 2016, CICM.

[27]  Cezary Kaliszyk,et al.  HOL(y)Hammer: Online ATP Service for HOL Light , 2013, Math. Comput. Sci..

[28]  Matthew England,et al.  Intelligent Computer Mathematics , 2017, Lecture Notes in Computer Science.

[29]  Till Mossakowski,et al.  Project Abstract: Logic Atlas and Integrator (LATIN) , 2011, Calculemus/MKM.

[30]  Tobias Nipkow,et al.  The Isabelle Framework , 2008, TPHOLs.

[31]  William M. Farmer,et al.  IMPS: An interactive mathematical proof system , 1990, Journal of Automated Reasoning.

[32]  Karsten Tabelow,et al.  Mathematical Models: A Research Data Category? , 2016, ICMS.