Abstract
The type system of Objective Caml has many unique features, which make ensuring the correctness of its implementation difficult. One of these features is structurally polymorphic types, such as polymorphic object and variant types, which have the extra specificity of allowing recursion. We implemented in Coq a certified interpreter for Core ML extended with structural polymorphism and recursion. Along with type soundness of evaluation, soundness and principality of type inference, and correctness of a stack-based interpreter, are also proved.†
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Monadic W in Coq;Proceedings of the 24th Brazilian Symposium on Context-Oriented Programming and Advanced Modularity;2020-10-19
2. Syntax vs Semantics;Proceedings of the 24th Brazilian Symposium on Context-Oriented Programming and Advanced Modularity;2020-10-19
3. A mechanical formalization of higher-ranked polymorphic type inference;Proceedings of the ACM on Programming Languages;2019-07-26
4. Polymorphic symmetric multiple dispatch with variance;Proceedings of the ACM on Programming Languages;2019-01-02
5. Formalization of a Polymorphic Subtyping Algorithm;Interactive Theorem Proving;2018