A Graded Modal Dependent Type Theory with Erasure, Formalized

TL;DR

This paper introduces a formal graded modal dependent type theory with erasure, formalized in Agda, enabling tracking of variable usage and erasure properties, with proven meta-theoretic guarantees.

Contribution

It develops a novel graded modal dependent type theory with erasure, formalized in Agda, and proves key properties like normalization and extraction soundness.

Findings

Formalization in Agda with meta-theoretic proofs

Extraction function preserves natural number values

Soundness of extraction for certain modalities

Abstract

We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $\Pi$-types, weak and strong $\Sigma$-types, natural numbers, an empty type, and a universe, and we also extend the theory with weak and strong unit types and graded $\Sigma$-types. The theory is parameterized by a modality structure, a kind of partially ordered semiring, whose elements (grades) are used to track the usage of variables in terms and types. Different modalities are possible. We focus mainly on quantitative properties, in particular erasure: with the erasure modality one can mark function arguments as erasable. The theory is fully formalized in Agda. The formalization, which uses a syntactic Kripke logical relation at its core and is based on earlier work, establishes major meta-theoretic properties such as subject reduction, consistency, normalization, and decidability of definitional equality. We also prove a substitution theorem for grade assignment, and preservation of grades under reduction. Furthermore we study an extraction function that translates terms to an untyped $\lambda$-calculus and removes erasable content, in particular function arguments with the "erasable" grade. For a certain class of modalities we prove that extraction is sound, in the sense that programs of natural number type have the same value before and after extraction. Soundness of extraction holds also for open programs, as long as all variables in the context are erasable, the context is consistent, and erased matches are not allowed for weak $\Sigma$-types.