Theorem Reuse by Proof Term Transformation

12Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Proof reuse addresses the issue of how proofs of theorems in a specific setting can be used to prove other theorems in different settings. This paper proposes an approach where theorems are generalised by abstracting their proofs from the original setting. The approach is based on a representation of proofs as logical framework proof terms, using the theorem prover Isabelle. The logical framework allows type-specific inference rules to be handled uniformly in the abstraction process and the prover's automated proof tactics may be used freely. This way, established results become more generally applicable; for example, theorems about a data type can be reapplied to other types. The paper also considers how to reapply such abstracted theorems, and suggests an approach based on mappings between operations and types, and on systematically exploiting the dependencies between theorems. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Johnsen, E. B., & Lüth, C. (2004). Theorem Reuse by Proof Term Transformation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3223, 152–167. https://doi.org/10.1007/978-3-540-30142-4_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free