A Semi-reflexive Tactic for (Sub-)Equational Reasoning
We propose a simple theory of monotone functions that is the basis for the implementation of a tactic that generalises one step conditional rewriting by “propagating” constraints of the form x R y where the relation R can be weaker than an equivalence relation. The constraints can be propagated only in goals whose conclusion is a syntactic composition of n-ary functions that are monotone in each argument. The tactic has been implemented in the Coq system as a semi-reflexive tactic, which represents a novelty and an improvement over an earlier similar development for NuPRL.
A few interesting applications of the tactic are: reasoning in type theory about equivalence classes (by performing rewriting in well-defined goals); reasoning about reductions and properties preserved by reductions; reasoning about partial functions over equivalence classes (by performing rewriting in PERs); propagating inequalities by replacing a term with a smaller (greater) one in a given monotone context.
KeywordsMonotone Function Natural Deduction Sequent Calculus Applicative Context Proof Search
Unable to display preview. Download preview PDF.
- 5.Grégoire, B.: Compilation de termes de preuves: un (nouveau) mariage entre Coq et OCaml. PhD thesis. Université Paris 7 (2004)Google Scholar
- 7.Hofmann, M.: Extensional concepts in intensional type theory. PhD thesis. LFCS Edinburgh (1995)Google Scholar
- 8.Kreitz, C.: The NuPRL 5 Manual, pp. 135–145Google Scholar
- 9.Renard, C.: Memoire de DEA: Un peu d’extensionnalité en Coq. INRIA Rocquencourt (2001)Google Scholar
- 11.Staples, M.: Window Inference in Isabelle. In: Proceedings of the Isabelle Users Workshop, Cambridge, UK, September 18-19 (1995)Google Scholar