Abstract
The paper describes the implementation of interactive ML-style modules in the recent version 7.4 of Coq proof assistant. Modules (especially higher-order) provide a very convenient tool for parametrized theories which was lacking in Coq for years. Their interactive character extends naturally the interactive environment provided by the proof assistant. The implementation follows the paradigm of recent versions of Coq to separate the correctness-critical code from the rest of the system, using abstraction barriers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chrza̧aszcz, J.: Modules in type theory with generative definitions. PhD thesis, to be defended (2003)
The Coq Proof Assistant, http://coq.inria.fr/
Courant, J.: A Module Calculus for Pure Type Systems. In: Typed Lambda Calculi and Applications 1997. LNCS, 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)
Coquand, T., Paulin-Mohring, C.: Inductively defined types. In: Martin-Löf, P., Mints, G. (eds.) COLOG 1988. LNCS, vol. 417. Springer, Heidelberg (1990)
Durán, F., Meseguer, J.: An extensible module algebra for Maude. In: In 2nd International Workshop on Rewriting Logic and its Applications (WRLA 1998). Electronic Notes in Theoretical Computer Science, vol. 15. Elsevier, Amsterdam (1998)
Filliâtre, J.-C.: Design of a proof assistant: Coq version 7 (2000) (unpublished)
Harper, R., Lillibridge, M.: A type-theoretic approach to higher-order modules with sharing. In: POPL 1994 [POP94], pp. 123–137 (1994)
Kammüller, F.: Modular reasoning in isabelle. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831. Springer, Heidelberg (2000)
Leroy, X.: Manifest types, modules, and separate compilation. In: POPL 1994 [POP94], pp. 109–122 (1994)
Marché, C., Paulin-Mohring, C., Urbain, X.: The Krakatoa tool for JML/Java program certification (2003) (submitted)
Owre, S., Shankar, N.: The formal semantics of PVS. Technical Report SRI-CSL-97-2, Computer Science Laboratory, SRI International, Menlo Park, CA (August 1997)
Conference Record of the 21st Symposium on Principles of Programming Languages, Portland, Oregon. ACM Press, New York (1994)
Sannella, D., Tarlecki, A.: Essential concepts of algebraic specification and program development. Formal Aspects of Computing 9, 229–269 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chrząszcz, J. (2003). Implementing Modules in the Coq System. In: Basin, D., Wolff, B. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2003. Lecture Notes in Computer Science, vol 2758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10930755_18
Download citation
DOI: https://doi.org/10.1007/10930755_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40664-8
Online ISBN: 978-3-540-45130-3
eBook Packages: Springer Book Archive