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.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.