Simple simpl

Pierre Boutillier 1, 2
1 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : We report on a new implementation of a reduction strategy in Coq to simplify terms during interactive proofs. By "simplify", we mean to reduce terms as much as possible while avoid- ing to make them grow in size. Reaching this goal amounts to a discussion about how not to unfold uselessly global constants. Coq's simpl is such a reduction strategy and the current paper describes an alternative more efficient abstract-machine-based implementation to it
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00816918
Contributor : Pierre Boutillier <>
Submitted on : Tuesday, April 23, 2013 - 11:33:55 AM
Last modification on : Friday, January 4, 2019 - 5:33:25 PM
Document(s) archivé(s) le : Thursday, July 25, 2013 - 11:22:52 AM

Files

ITP13_Boutillier.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00816918, version 1

Collections

Citation

Pierre Boutillier. Simple simpl. 2013. ⟨hal-00816918⟩

Share

Metrics

Record views

624

Files downloads

196