Alignment-based Translations Across Formal Systems Using Interface Theories

12/05/2017
by   Dennis Müller, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/05/2020

Leveraging the Information Contained in Theory Presentations

A theorem prover without an extensive library is much less useful to its...
research
02/12/2018

ProofWatch: Watchlist Guidance for Large Theories in E

Watchlist (also hint list) is a mechanism that allows related proofs to ...
research
05/05/2020

Experiences from Exporting Major Proof Assistant Libraries

The interoperability of proof assistants and the integration of their li...
research
02/11/2014

Learning-assisted Theorem Proving with Millions of Lemmas

Large formal mathematical libraries consist of millions of atomic infere...
research
07/21/2021

JEFL: Joint Embedding of Formal Proof Libraries

The heterogeneous nature of the logical foundations used in different in...
research
05/02/2019

Typed-based Relaxed Noninterference for Free

Despite the clear need for specifying and enforcing information flow pol...
research
03/25/2023

From Gödel's Incompleteness Theorem to the completeness of bot religions (Extended abstract)

Hilbert and Ackermann asked for a method to consistently extend incomple...

Please sign up or login with your details

Forgot password? Click here to reset