Abstract
The paper presents the system of named modules implemented in Coq version 7.4 and shows that this extension is conservative. It is also shown that the implemented module system is ready for the future planned extension of Coq with definitions of functions by means of rewrite rules. More precisely, the impact of the module system on the acceptance criterion for rewrite rules is carefully studied, leading to the formulation of four closure properties that have to be satisfied by the acceptance criterion in order to validate the conservativity proof. It turns out that syntactic termination criteria such as Higher Order Recursive Path Ordering or the General Schema can be adapted to satisfy these closure properties.
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
Blanqui, F.: Definitions by rewriting in the calculus of constructions. In: Sixteenth Annual IEEE Symposium on Logic in Computer Science, Los Alamitos, USA, June 2001, pp. 9–18. IEEE Comp. Soc. Press, Los Alamitos (2001)
Blanqui, F.: Definitions by rewriting in the Calculus of Constructions. Mathematical Structures in Computer Science (2003) (to appear)
Chrza̧szcz, J.: Implementation of modules in the Coq system. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 270–286. Springer, Heidelberg (2003)
Chrza̧szcz, J.: Modules in Type Theory with Generative Definitions. PhD thesis, Warsaw Univerity and University of Paris-Sud (January 2004), Available from http://www.mimuw.edu.pl/~chrzaszc/papers
The Coq proof assistant, http://coq.inria.fr/
Coquand, T.: Pattern matching with dependent types. In: Proceedings of the Workshop on Types for Proofs and Programs, Båstad, Sweden, pp. 71–83 (1992)
Coquand, T., Huet, G.: The calculus of constructions. Information and Computation 76, 95–120 (1988)
Coquand, T., Paulin-Mohring, C.: Inductively defined types. In: Martin-Löf, P., Mints, G. (eds.) COLOG 1988. LNCS, vol. 417, Springer, Heidelberg (1990)
Courant, J.: A Module Calculus for Pure Type Systems. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 112–128. Springer, Heidelberg (1997)
Courant, J.: Un calcul de modules pour les systèmes de types purs. Thèse de doctorat, Ecole Normale Supérieure de Lyon (1998)
Harper, R., Lillibridge, M.: A type-theoretic approach to higher-order modules with sharing. In: POPL 1994 [17], pp. 123–137.
Harper, R., Pfenning, F.: A module system for a programming language based on the LF logical framework. Journal of Logic and Computation 1(8) (1998)
Leroy, X.: Manifest types, modules, and separate compilation. In: POPL 1994 [17], pp. 109–122.
Luo, Z.: An Extended Calculus of Constructions. PhD thesis, University of Edinburgh (1990)
Owre, S., Shankar, N., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS Language Reference. Computer Science Laboratory, SRI International, Menlo Park, CA (September 1999)
Paulson, L.C.: Isabelle: the next 700 theorem provers. In: Odifreddi, P. (ed.) Logic and Computer Science, Academic Press, London (1990)
Conference Record of the 21st Symposium on Principles of Programming Languages, Portland, Oregon. ACM Press, New York (1994)
Walukiewicz-Chrza̧szcz, D.: Termination of rewriting in the calculus of constructions. Journal of Functional Programming 13(2), 339–414 (2003)
Walukiewicz-Chrza̧szcz, D.: Termination of Rewriting in the Calculus of Constructions. PhD thesis, Warsaw University and University Paris XI (2003)
Werner, B.: Méta-théorie du Calcul des Constructions Inductives. PhD thesis, Université Paris 7 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chrza̧szcz, J. (2004). Modules in Coq Are and Will Be Correct. In: Berardi, S., Coppo, M., Damiani, F. (eds) Types for Proofs and Programs. TYPES 2003. Lecture Notes in Computer Science, vol 3085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24849-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-24849-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22164-7
Online ISBN: 978-3-540-24849-1
eBook Packages: Springer Book Archive