Manifest types, modules, and separate compilation
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type-theoretic approach to higher-order modules with sharing
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Applicative functors and fully transparent higher-order modules
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Recursive structures for standard ML
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Explicit Universes for the Calculus of Constructions
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
VDM '91 Proceedings of the 4th International Symposium of VDM Europe on Formal Software Development-Volume 2: Tutorials
Theory Interpretations in PVS
Mixin' up the ML module system
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Interpretation of locales in isabelle: theories and proof contexts
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
| Hi-index | 0.00 |
We present an evolution of the Coq module system where we unify both structure (i.e. module implementation) and signature (i.e. module interface) into a single concept called theory. In order to easily derive theories, we equip our system with three theory combinators: application, inclusion and refinement. In this work we also isolate a new notion of Δ-equivalence that characterizes in a decidable way the exact equalities between paths implied by modular construction. This equivalence provides the adequate information to simulate a transparent name-space from the user's point of view and furthermore eases the integration of the non-logical features of Coq. Finally, we give a sketch of conservativity proof relative to the Calculus of Constructions. By emancipating from SML module system legacy, this work contributes to a more flexible and clearer system of modules for Coq.