Proof Reuse with Extended Inductive Types

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

Abstract

Proof assistants based on type theory such as COQ or LEGO, put emphasis on inductive specifications and proofs by featuring expressive inductive types. It is frequent to modify an existing specification or proof by adding or modifying constructors in inductive types. In the context of language design, adding constructors is a common practice to make progress step-by-step. In this article, we propose a mechanism to extend and parameter inductive types, and a proof reuse mechanism founded on proof terms reuse. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Boite, O. (2004). Proof Reuse with Extended Inductive Types. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3223, 50–65. https://doi.org/10.1007/978-3-540-30142-4_4

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