Indexed metadata

A certified implementation of ML with structural polymorphism and recursive types

JACQUES GARRIGUE

Source record

Source: Crossref

Published: Nov 11, 2014

DOI: 10.1017/s0960129513000066

Open original source ↗

Source 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. †

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A certified implementation of ML with structural polymorphism and recursive types — Mathematical Frontier Network