Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barthe, G., Pons, O., Capretta, V.: Setoids in type theory. Journal of Functional Programming 13(2), 261–293 (2003)
Basin, D.: Generalized Rewriting in Type Theory. Journal of Information Processing and Cybernetics 30(5/6), 249–259 (1994)
Courtieu, P.: Normalized Types. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 554–569. Springer, Heidelberg (2001)
Lüth, C., Wolff, B.: TAS — A Generic Window Inference System. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, pp. 405–422. Springer, Heidelberg (2000)
Grégoire, B.: Compilation de termes de preuves: un (nouveau) mariage entre Coq et OCaml. PhD thesis. Université Paris 7 (2004)
Grundy, J.: Transformational hierarchical reasoning. The Computer Journal 39(4), 291–302 (1996)
Hofmann, M.: Extensional concepts in intensional type theory. PhD thesis. LFCS Edinburgh (1995)
Kreitz, C.: The NuPRL 5 Manual, pp. 135–145
Renard, C.: Memoire de DEA: Un peu d’extensionnalité en Coq. INRIA Rocquencourt (2001)
Robinson, P.J., Staples, J.: Formalizing a hierarchical structure of practical mathematical reasoning. Journal of Logic and Computation 3, 47–61 (1993)
Staples, M.: Window Inference in Isabelle. In: Proceedings of the Isabelle Users Workshop, Cambridge, UK, September 18-19 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coen, C.S. (2006). A Semi-reflexive Tactic for (Sub-)Equational Reasoning. In: Filliâtre, JC., Paulin-Mohring, C., Werner, B. (eds) Types for Proofs and Programs. TYPES 2004. Lecture Notes in Computer Science, vol 3839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617990_7
Download citation
DOI: https://doi.org/10.1007/11617990_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31428-8
Online ISBN: 978-3-540-31429-5
eBook Packages: Computer ScienceComputer Science (R0)